Others

Accumulate the Dimensionality Reduction parts and calculate the maximum continuous and # Include # include # include # include # include # define maxn 110 using namespace STD; int A [maxn] [maxn]; int B [maxn]; int main () {int N; while

Bellman_fordAlgorithmCheck whether a negative weight loop exists in the graph. If the negative weight loop does not exist in the figure, the maximum short-circuit path goes through n-1 nodes. If the number exceeds n-1 nodes, the negative weight loop

Liu rujia's book 143 Merge Sorting to find Reverse Order Number Pairs # Include # include # include # include # include using namespace STD; int A [500010], B [500010]; long long ans; void merge_sort (int * a, int X, int y, int * t) {If (Y-x>

Calculate the weights between the values and then the Minimum Spanning Tree. # Include # include # include # include # include # include # include using namespace STD; struct point {Double X, Y ;}; struct edge {int U, V; double W; void F (

DP only has three operations: Str [I]! = STR [J] dp (I, j) = min (dp (I + 1, J), DP (I + 1, J-1), DP (I, J-1 )) # Include # include # include # include using namespace STD; char STR [1010]; int f [1005] [1005]; int N; int dp (int A, int B)

DP stores stones in the queue by three sides and sorts the blocks by the bottom area. DP sets the maximum height and sets the longest path of the nested rectangle. # Include # include # include # include using namespace STD; struct tone {int

Source: https://www.interviewstreet.com/challenges/dashboard/?problem/4fd05444acc45, Solution report: Sort the price of the flowers, then K people must first buy the most expensive K flowers, and then buy them at the lowest price. # Include

Simple and check the collection of water ..... # Include # include # define maxn 30005int Fa [maxn], ANS [maxn], n, m; int findd (int x) {return Fa [x] = x? X: Fa [x] = findd (Fa [x]);} int main () {int t; scanf ("% d", & T); While (t --)

Source: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1163   Solution report: Hard DP won't do it. Start with a simple process ~ From bottom up, F [k] saves the maximum values of all possible paths from bottom to a [K, then f [k] = A [k] +

If there are no sub-sequences of three elements in the sequence that constitute an equal difference, the output is yes or no. Mark the position where each number appears, and start from 0 to find the three-element arithmetic difference series. If

Source: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1836   Solution report:   Set the height array of each Member to H [0... n-1], and N to the total number. To meet the question conditions, for 0   There is a recursive formula: D [I] = max (d [

// Convert from MFC Development Guide, http://www.vchelp.net/ Sort in listctrlWen Yi Yang wyy_cq@21cn.com Co., http://www.vchelp.net/There is a row of buttons at the top of the list control (clistctrl). You can sort records by selecting different

Differences between pointers and array names:   The pointer can be used in this way. # Include Int main () { Int A [3] = {3, 5, 9 }; Int * P =; Printf ("% d \ n", * P ); P ++; Printf ("% d \ n", * P ); Return 0; }     However, the array name cannot

A Dynamic Planning question Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2479  Maximum Sum Time limit:1000 ms   Memory limit:65536 K Total submissions:17327   Accepted:5239 DescriptionGiven a set of N integers:

Source of http://www.leetcode.com/onlinejudge Solution Report: similar to the previous question class Solution {public: int min; void f(int index, int size, vector &num, int sum, int target) { if (size == 3) { if

There is a question about the online search: the original ordered array is divided into two parts, and then the two parts are handed in.Returns a new array. Write a function. The parameter is the new array, and it is required to findNodes, and time

Source: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1521   Solution report:   Typical Huffman tree problems: I used STL's priority_queue and adjusted it for one afternoon.   # Include # include # include using namespace STD; class node {

Source: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1321   Solution report:   For Board issues, the position of a piece can only be #, and it cannot be the same as that of the same column. because I use the search in the ascending order of rows,

Description It's not surprising that Michael loves skiing because skiing is really exciting. But in order to get the speed, the slide area must be tilted down, and when you slide to the bottom, you have to go uphill again or wait for the elevator to

Source of https://www.interviewstreet.com/challenges/dashboard/#problem/4fffc24df25cd Solution report: To solve this problem, a tree can remove a maximum of several edges so that the number of nodes in each split tree is an even number. The question