C++

/* This is an enumeration search of the radius and height, however, pruning is required */# include # include # include # include using namespace std; int n, m, minv [21], mins [21], best; void dfs (int M, int v, int s, int r, int h) {int I, j,

Maze ProblemsTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 6322 Accepted: 3673 Description Define a two-dimensional array: Int maze [5] [5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, };It represents

# Include # include # include # include # include # include # include # include # include # include # include # include // define MAX 100005 # define INF 0x7fffff # define REP (I, s, t) for (int I = (s); I n> m) {if (n = 0 & m = 0)

# Include using namespace std;/* 3 positive subtraction problem description: two positive numbers of any length are subtracted. The two positive numbers can contain decimal points or integers. Please output the result. The entered string does not

Integer Inquiry One of the first users of BIT's new supercomputer was Chip Diller. He extended his activation of powers of 3 to go from 0 to 333 and he got Ed taking various sums of those numbers. ''This supercomputer is great, ''remarked Chip. ''I

From 1 to n and then to 1, each side can only walk once, seeking the shortest distance. Graph creation: each side can only go once, that is, the traffic is 1, the source point is added to connect with 1, the capacity is 2, the cost is 0, the

/* For the current user, if mat [n] [m] = 0 after completing his/her operations, the current user is the winner. Because if mat does not exist in other positions, you must win. If mat exists, let the next position reverse the one. */# include #

// Hdu robot # include # include # include # include using namespace std; inline void RD (int & ret) {char c; do {c = getchar () ;}while (c '9'); ret = c-'0 '; while (c = getchar ()> = '0' & c # include # include # include using namespace

Skip this section if you want to use the AC... Questions should be fully understood. However, I personally think this question is very bad and the meaning is too vague. First, the number of incoming and outgoing requests can only be one time !! This

There are many points on a two-dimensional coordinate axis. The point is either 0 or 1. Then there are two more operations. C: change to (x1, y1) as the top left vertex (x2, y2). Change to 0 for each vertex in the lower right vertex. Q: Output A [x]

Problem EForeign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 second   Your non-profit organization (iCORE-international Confederation of Revolver Enthusiasts) coordinates a very successful foreign student exchange program. over

Given n strings consisting of only uppercase letters, select as many strings as possible so that each letter in these strings is an even number. N Idea: directly enumerate the selected or unselected strings. The complexity is O (2 ^ n ). In fact,

Dynamic Planning state equation: Dp [I] [j] = d [I] [k] + dp [k + 1] [j] + (sum [k]-sum [I-1]) + (sum [j]-sum [k]) Boundary: 0 If (I = j) dp [I] [j] = 0; Sum [I] = sum of the first I count.   # Include # include using namespace std; int dp [

Question: n operations Push into container Pop pops up a maximum value I started to use set to repeat wrong. Here, the number of input containers is repeated, so the multiset     # Include # include using namespace std; multiset ss;

Question meaning: N count You can divide it into multiple segments. The length of each segment cannot exceed 20. Yes, sum (ai * (2 ^ bi) is the smallest. ai is the first number in each segment, and bi is the length. Solution: Set dp [I] = min (dp [I]

When the dfs value is returned, the return values of the two Nos are different. The wrong one is-100, and the other is-10. It is definitely incorrect !! Hey, you have found it, changed it, and submitted it! By the way !! %

Question: Calculate the strongly connected component with a degree of 0. Ideas: Point Reduction There are two specific implementations: 1. traverse all edges. If the points at both ends of the edge are not in the same strongly connected component,

Question: give N team names consisting of lowercase letters, print them out with an old printer, and ask at least a few times to press the keyboard (there is no need to enter the order between team names ), this printer can only perform the

The last question of the Line Segment tree is now. The line segment tree can do a lot of work, and it has higher requirements for itself when combined with DP. What you have to do is still far away ~ This question has been debugged for a long time...

Calculate the Geometric Convex Hull problem. Use the cross product to determine whether all vertices meet the same direction of p1 (x1, y1), p2 (x2, y2), p3 (x3, y3 ); based on (x1-x3) * (y2-y3)-(x2-x3) * (x1-y3 ); #include #include #include