Others

Sumsets Time Limit: 6000/2000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1030 accepted submission (s): 406 Problem descriptionfarmer John commanded his cows to search for different sets of numbers that sum to a

The suspects Time limit:1000 ms   Memory limit:20000 K Total submissions:17128   Accepted:8254 Description Severe Acute Respiratory Syndrome (SARS), an atypical ppneumonia onia of unknown aetiology,

Uva_12508 One hurdle of this question is to enumerate the external rectangles of the triangle. If you think of this, it is not difficult to think about the remaining ideas, calculate the number of triangles (of course, the external rectangle of

Uva_10382 Whether the sprinkler can cover the lawn depends only on whether the blue area of each circle in the figure can cover the lawn. In this way, the problem is transformed into several lines, calculates the minimum number of line segments

Uva_10340 We may generate the string s from left to right, so that we only need to scan t in sequence. If the current character is the same as the character to be generated in S, we can generate it, in this way, we can ensure that the position of

La_3602 Since each bit is independent, we can process each bit in sequence. Find the most frequently occurring characters for each digit. If the number of occurrences is the same, find the character with a small Lexicographic Order. # Include #

Zoj_3209 You can solve the problem accurately by using dancing links. # Include # Include String . H> # Include # Define Maxn 510 # Define Maxm 910 # Define Maxd 460010 # Define INF 0x3f3f3f Int N, M, P, size, U [maxd], d [maxd], L [maxd], R

Uva_000036 A greedy policy is to copy all rows so that more rows can be obtained. So the number of rows will change to 1, 2, 4 ,..., 2 ^ I ,..., if the number of remaining rows is less than the number of existing rows, you can copy the number of

/* DP [I] [J] indicates the number of swap times when I is recursive to J. I either form a cycle, then do not increase the number of swap, or put to the front of the number of a number of I-1, so as to insert into a loop, in this way, the number of

Uvalive_4981 First, you can use a stack to determine whether a sequence of parentheses is valid. To make the Lexicographic Order only a little larger, the longer the prefix length, the better. Therefore, you can enumerate the length of the

Big event in HDU Time Limit: 10000/5000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 16224 accepted submission (s): 5725 Problem descriptionnowadays, we all know that computer College is the biggest department in

Wireless Network Time limit:10000 ms   Memory limit:65536 K Total submissions:13323   Accepted:5638 Description An earthquake takes place in Southeast Asia. the ACM (Asia cooperated medical team)

Poj_2553 This question was originally easier to start with. In the end, we only need to require that all outputs 0 Point contained in the strongly connected component of, and then output in Lexicographic Order. However, since the name is

Uvalive_4318 Compared with the general decision-making on the tree, this question is different from the decision-making point of each other, therefore, each vertex can be viewed in two states, one corresponding to the max node in the game tree,

Hdu_00007 Create 10 tree arrays based on K values, and create k tree arrays based on I % K in each type, that is, 55 tree arrays, in this way, each modification operation only performs operations on one of the tree arrays, so it is the complexity

Poj_2989 Find the number of large groups, myProgramRefer to the pseudo on the Wiki.CodeHttp://en.wikipedia.org/wiki/bron%e2%80%93kerbosch_algorithm. # Include # Include String . H> # Define Maxn 130 Int N, m, a [maxn], G [maxn] [maxn]; Void

Cube stacking Time limit:2000 ms   Memory limit:30000 K Total submissions:15900   Accepted:5419 Case time limit:1000 ms Description Farmer John and Betsy are playing a game with N (1

Poj_3308 This topic is a bit similar to the minimum point set coverage problem in a bipartite graph. However, due to the edge weight, the maximum matching of a bipartite graph cannot be used directly. After referring to the ideas of

Rochambeau Time limit:5000 Ms   Memory limit:65536 K Total submissions:1575   Accepted:540 Description NChildren are playing rochambeau (scissors-rock-cloth) game with you. one of them is the

Parity game Time limit:1000 ms   Memory limit:65536 K Total submissions:5168   Accepted:2028 Description Now and then you play the following game with your friend. your friend writes down a