## 0 basic society on the dynamic planning of editing distance (with C + + source code)

catalogue Question 1: judgment subsequence Question 2: different subsequences Question 3: deletion of two strings Question 4: editing distance Today, we continue to study the algorithm problems of dynamic programming, which are a series of algorithm problems about finding editing distance. Let's make a summary. I'll copy these problems t ...

Posted by social_experiment on Thu, 10 Mar 2022 21:51:02 +0100

## Challenge program design: codeforces round #776 (Div. 3) g. counting shortcuts

Title portal Main idea of the title: Given an undirected graph G without self ring and mu lt iple edges, as well as the starting point and end point S and T, the edge weight is 1, find the path length from S to T < = the number of shortest path length + 1. Problem solving ideas Since the edge weight length is constant as 1, the shortest ...

Posted by ThEMakeR on Wed, 09 Mar 2022 10:18:26 +0100

## [daily question 1] preparing for the Blue Bridge Cup -- Python programming | Day14 | path | real problem code analysis

๐ About the author: Hello, I'm brother cheshen, cheshen at No. 18 Fuxue road ๐ฅ โก About - > Che Shen: the fastest time from the bedroom to the laboratory is 3 minutes, and the slowest time is 3.5 minutes (that half minute is actually waiting for the traffic light) ๐ Personal homepage: Drivers only need cars and hands, and the pressure comes f ...

Posted by james_4k2 on Wed, 09 Mar 2022 00:37:37 +0100

## "Fool code template" solves three basic problems

"Fool code template" solves three basic problems โโ Preface: the focus of this article is the establishment and application of fool code template. In the part of knapsack principle, you may talk less and jump. You can focus on absorbing the knowledge of "code template part" and the application method of cod ...

Posted by Hoangsta on Tue, 08 Mar 2022 12:49:30 +0100

## 8 minutes to learn the longest common subsequence (with C + + source code, the one that runs directly)

Algorithm is really wonderful. It's easy to be addicted after learning. Of course, it's said on a simple premise. If I encounter that kind of problem, I also have a headache. Today's plot is still the form of dialogue between teachers and students. In this way, I think it is more gradual and less abrupt. What do you think? Now, students, let' ...

Posted by dragon_sa on Sat, 05 Mar 2022 21:52:52 +0100

## Ordering problem (classic 0-1 backpack)

subject describe Peking University network laboratory often needs to order takeout for activities, but the maximum amount of reimbursement for each order is C yuan. There are N kinds of dishes to order. After ordering for a long time, the network laboratory has a quantitative evaluation score for each dish i (indicating the palatability of th ...

Posted by mbh23 on Sat, 05 Mar 2022 09:09:04 +0100

## Maze box four color theorem digital grouping problem solution

1. Maze Title Description Recently, little Y is playing a maze game. The game is played on an n * m grid. Each grid may be an open space or an obstacle. At the beginning of the game, the character controlled by the player is located in an open space in the figure. During the game, players can use the up, down, left and right keys to control ...

Posted by ryanhowdy on Fri, 04 Mar 2022 21:02:52 +0100

## "Sword finger Offer (2nd Edition)" series questions

Sword finger offer brush questions 03 [duplicate number in array] class Solution { public: int findRepeatNumber(vector<int>& nums) { sort(nums.begin(),nums.end()); for(int i=0;i<nums.size();i++) { if(nums[i+1]==nums[i]) { //cout<<nums[i]<<endl; ...

Posted by Cobby on Thu, 03 Mar 2022 23:19:24 +0100

## Question solution of Nanhua University level 19 soft Zhuo trial [code sentence by sentence analysis]

First of all, the official solution of last year is here. You can have a look 19 official explanation of the selection of ruozhuo In my problem solution, I will analyze the code of problem C sentence by sentence as far as I can. Problem C has not been figured out yet Soft Zhuo selects A Taoge to supplement the spirit Soft Zhuo selection A This ...

Posted by NoMansLand on Thu, 03 Mar 2022 14:04:41 +0100

## 1580 plus binary tree (NOIP2003 LOJ10158 LUOGU1040 popularity + / improvement) and interval dynamic rules on the tree matching the middle order traversal

General catalogue Online evaluation address (ybt) Evaluation address (LOJ) Online evaluation address (LUOGU) Understanding examples is the key. By the middle order traversal, pre order traversal to determine the sample, binary tree form. The sample score is calculated as follows: f(2)=7 f(5)=1*7+5=12 f(5)=10 f(4)=1*10+2=12 f(3)=12*1 ...

Posted by urgido on Thu, 03 Mar 2022 13:53:30 +0100