Others

The intersection points on the left are sorted from small to large, and the reverse order number on the right is obtained. Use merge to calculate the number of vertices on the left. The answer is the number of straight lines + intersection points + 1

What about Manhattan sort? Nana? In fact, we use greed, because the best way to minimize the total movement distance is to directly move it to the place where it should be placed, and each number is unique. Struct node {int ID; int V;} p [33];

Simple DFS, BFs can also Int G [11] [11]; int n, m; bool vis [11] [11]; int d [4] [2] = {, 0, 0,-1, 0}; int ans; void DFS (int x, int y) {If (vis [x] [Y]) return; vis [x] [Y] = 1; int I; If (x = 1 | Y = 1 | x = n | Y = m) ans ++; for (I = 0; I

# Define n 101int DP [101] [101]; // maximum experience of killing I with a tolerance of J int A [101], B [101]; int main () {int n, m, K, s; while (scanf ("% d", & N, & M, & K, & S )! =-1) {// additional experience values, reserved patience,

The homogeneous structure of the root tree means that the two trees have the same shape and the subtree can be rotated. Therefore, when the number of subnodes of the subtree is the same, the homogeneous structure can be determined. You do not need

/* Construct a DFS tree. The sequence dfn [I] Is the depth priority number, indicating the serial number of the I node accessed during DFS, low [I] indicates the minimum depth priority that can be accessed from the I node. If and only when node u

Simulation does not explain Int A [110]; int main () {int t; scanf ("% d", & T); int CA = 1; while (t --) {int N; scanf ("% d", & N); int I, j; for (I = 1; I A [2]) win = 1; else win = 2; break;} int II = I, JJ = J; while (II

First, paste the C code corresponding to the pseudocode in several books. MAX-HEAPIF: void MAX_HEAPIFY(int *a, int len, int i){ int l=LEFT(i),r=RIGHT(i); int largest=i; if(l BUILD-MAX-HEAP: void BUILD_MAX_HEAP(int *a, int len){ for(int

This is a very good question. I used the shortest circuit, the second answer, and the DFS. The question was too bad. First of all, the number of labels for the total number of 100 points may reach 100. If the number cannot be compressed, it is only

Today I encountered a problem poj2184. The idea is to calculate the optimal solution that meets the requirements after the DP OF THE 01 backpack. However, when solving the backpack, a problem occurs: the volume has a negative number, so there will

Obtain the machine name =============================================== ==================================== the code is as follows: pay attention to the following settings. Otherwise, an error may occur. To run the preceding script, you need to

Similar to the poj 1185 Artillery Position int g[16][16];int st[1001];char str[101];int dp[16][(1>1))return 0; return 1;}void init(){ tot = 0; int i; for(i=0;i>=1; } return res;}void gao(){ memset(dp,0,sizeof(dp)); int i,j,k;

This is also the reverse order number, but the topic description is a bit strange =! Given is the hook ID, not a one-to-one relationship, so you need to map it. You prefer to use merge to find the reverse order number. #define N 1010int

The maximum spanning tree. You can change the prime algorithm. Pay attention to the duplicate edge !!! # Define n 1005int G [N] [N]; int vis [N]; int dis [N]; int N; int prime () {int I, J; for (I = 1; I minm) {minm = dis [J]; k = J ;}} vis [k] = 1

Solution 1: Triangle Area = bottom * Height/2. Solution 2: Triangle Area = sina * B * C/2. Sina = SQRT (1-cosa * COSA ); Cosa according to cosine theorem: cosa = (C ^ 2 + B ^ 2-A ^ 2)/2bc; Disadvantage: in the middle, the float type is divided by

In 3D vector spaceIf A and B are two vectors, their cross product C = AXB can be strictly defined as follows. (1) | c | = | A × B | = | A | B | sin (2) c branch a, and C Branch B, (3) the direction of C should be determined by the "right hand

Note the initialization of the tree array. C [I] [J] = lowbit (I) * lowbit (j) is equivalent to add (I, j, 1! Because the lowbit function of the tree array is to extract the percentile 1 of X. #define N 1100int c[N][N];int g[N][N];int lowbit(int x){

Release the explanation later... Int st [66]; int cur [66]; char STR [110] [15]; int DP [110] [66] [66]; // DP [I] [J] [k] indicates the maximum number of artillery units when the state of row I is J and the state of the I-1 is K. Int num [66]; int

The violent DFS is assumed to be all white, and then each vertex is enumerated. the DFS of each vertex is messed up. You can use the largest group to perform a search on the Internet. I have never seen it before. Put it here first, I learned to do

After the problem solving report, first paste code http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3275 #define N 100005char str[N];int sum0[N*4],sum1[N*4];bool mark[N*4];void up(int id){ sum0[id] = sum0[id>1; build(s,mid,id>1;