Others

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1879   # Include # include # define Max 0x3fffffff int map [101] [101], DIS [101], vis [101]; int main () {int N; freopen ("a.txt", "r", stdin); While (scanf ("% d", & N) {int I, J, K; for

maximum submatrix problem: Problem description: (for details, see http://acm.pku.edu.cn/JudgeOnline/showproblem? Problem_id = 1050) given a matrix of N * n (0 example: 0-2-7 0 9 2-6 2 -4 1-4 1 -1 8 0-2 the upper left

The first time I heard that there is a monotonous stack, in fact, the monotonous stack is similar to the single-order adjustment queue, and the elements in the stack are also monotonous. In this case, we need to maintain a strictly monotonous and

This question is more restrictive than that of poj. It defines the size of the sub-matrix, starting to see the time of 10 s, decisive violence, then decisive TLE, and a little bit of optimization or TLE! Then we use DP. How is DP used? It is very

# Include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include using namespace STD; # define ll long # define PI ACOs (-1.0) # define n 1

Http://www.codeforces.com/contest/79/problem/ B # Include using namespace STD; __ int64 POS [1010]; # include int main () { // freopen ("a.txt", "r ", stdin); int n, m, K, T; while (scanf ("% d", & N, & M, & K, & T )! = EOF) { int I, j; int

Document directory To commemorate the first TC question... The format is really cool and not used Problem Statement Definition Constraints Examples   To commemorate the first TC question... The format is really tough, and it's not

Let's put it down first. #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;int lowbit(int t){return t&(-t);}int countbit(int t){return

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1241   Basically, I have never done BFs, so I tried to do it. After reading a courseware, I basically understood the principles of BFS. PS: courseware Web site:

Generation template... Don't explain. Please understand !... Unlimited coin Model Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1028 # Include int c1 [130], C2 [130]; int main () { int N; while (scanf ("% d", & N )! = EOF) { int I, j, k;

Http://poj.org/problem? Id = 1228 The question is to give you n points and ask if you can determine the unique convex hull; Because these vertices are all boundary points, you only need to determine whether each boundary has> = 3 vertices. If yes,

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3572 Question: N tasks + M machines are given. There is also a task processing time limit + Start Time + end time. One machine can only process one task at a time, however, a task can be processed on

According to Luo's thesis, an ascii code must be added to the middle of the two strings, which is a character smaller than any letter. Longest public substring (pku2774, ural1517)Returns the longest common substring of two strings A and B.Algorithm

The suffix array has always been very powerful, and its statistical function is one aspect. The following uses two examples to illustrate how to use a powerful suffix array for statistics. [Example 1] poj 3415 http://poj.org/problem? Id = 3415 This

Data Structure suffix Array 1. Overview Suffix array is a powerful tool to solve the string problem. Compared with the suffix tree, it is easier to implement and consumes less memory. In practical applications, Suffix Arrays are often used to

Euler's function refers to the number of positive integers (including 1) of a positive integer N, less than N, and with N interconnectivity ). General Formula: Phi (x) = x * (1-1/P1) * (1-1/P2) * (1-1/P3) * (1-1/P4) ..... (1-1/PN), where p1, p2 ....

Quicksort is an improvement in Bubble sorting. Proposed by C. A. R. Hoare in 1962. Its basic idea is: Split the data to be sorted into two independent parts by one sort, and all the data in one part is smaller than all the data in the other part,

Many chapters in UNIX network programming use the Echo program as an example, because the program logic is simple-the client only reads the terminal and then sends the read string; the server simply reads the string sent by the client and then

It's time for TLE to die. It's just over n optimizations, and it's full of tears. Question: A_1, a2... A9, AI indicates that there is an ai I. Ask how many different numbers are composed of these numbers and what is it after mod 1000000007. Question:

In an undirected connected network, removing an edge set can change it into two connected components. This edge set is the cut set. The minimum cut set is of course the right and the smallest cut set. The maximum flow theorem of the smallest cut can