Others

I swear I will never watch discuss again ~~ # Include #include # include using namespace STD; int A [101]; int B [101]; int mid (int A, int B, int C) {int num [4]; num [0] = A; num [1] = B; num [2] = C; sort (Num, num + 3 ); return num [1];}

Negative question aggregation = That is to say, today's water problem is a little more = I wanted to use the shortest circuit, but I didn't want to be so troublesome. I don't want to use the scrolling array. I just need water if I can. I remember

There are many issues on the network. I will not talk about it.First, the prototype of the grouping backpack:For an item group, a backpack with a capacity of V is assigned. The items in each group are mutually exclusive. A maximum of one item can be

Today, the Chengdu semi-finals were another tragedy. Through these three semi-finals, I deeply felt the gap between us and other teams. After three rounds of hard work, we couldn't even enter the regional preliminaries, not to mention this year's

I did this during the weekend when I was abused, but the description of the question at that time is different from that at present; The question is to map pigs to cities in the order of pigs, while the question of POJ is to output pigs in the order

Finally, spfa ac is used ~~ This question is really !! I will summarize the difference constraint and SPFA later ~~, I think this question is quite interesting. What is WA ??? Not that clear ~~ It is AC. It is so easy to form a linked list ~ Hey hey

The code is much clearer when operators are used for the first time. If the two sides are known, calculate the 4th points that constitute the parallelogram. Use the vector addition property. With trick, public points are not necessarily the second

I haven't done the problem for a long time. I have made detailed statistics for two months. I wasted two months doing something irrelevant. I am sorry to my teammates here... let's do some exercises and try to feel a little more. Analysis: This

I think my professional courses are falling behind, and acm is not doing well in this aspect = It hurts me !! Write a blog and start learning !! The fast power of the matrix is similar to a ^ B % n. Use the binary idea. In this question, we need to

At the beginning, I thought wrong. I thought of him as a string pattern matching question. By constructing A string between [A, B] and then performing mode matching on the Main string, think about using the kmp algorithm. I am not very familiar with

Although it's a question, it's too boring ~~~ In the past, floyd used k as an inner repetition loop. In this case, it was wrong. I don't know why. In short, it was wrong. I have been debugging for n years ~ Alimama ~~ #include#define MAXN

The difficulty of this question is similar to that of the previous bare template.Check whether the string is the prefix of another string,Check whether the count of the last node is 1 in the dictionary tree.If the value is 1, the string is unique.If

E-Seven tombsTime Limit: 3000/1000 ms (Java/Other) Memory Limit: 65535/32768 K (Java/Other) Total Submission (s): 31 Accepted Submission (s): 9 Font: times New Roman | Verdana | GeorgiaFont Size: tables → Problem Description tower. laxia is buried

This question is still normal ~ Saying ~ Still, the shortest path calculates the maximum value .... The new question is that there are three situations. 1. No negative ring Solution 2. The distance is too far to reach N points not updated 3. Maximum

The second AC automatic machine. It is no different from the previous one. It is a basic AC automation template.Question: There are some virus sequences. You can find all the virus types in the main string. Find the virus type carried by each

[General idea] Given an undirected graph, obtain the number of these edges (at least the edges that appear in a spanning tree. [Solutions] Understand MST ideas and apply greedy ideas. Traverse these edges from small to large, and the weights are the

Simple DP /*ID:sevenst4;LANG:C++PROG:maze1*/#includeusing namespace std;char m[222][88];int hi[101][40];int fx( int x ){ return (xhi[i][j-1]+1 ) hi[i][j]=hi[i][j-1]+1,flag=true; if( m[fx(i)][fy(j)+1]==' ' && hi[i][j]>hi[i][j+1]+1 )

I haven't done any questions for a few days. I want to integrate my knowledge. Otherwise, it would be wise to use the sea-question tactics! I am currently interested in graph theory, combined mathematics, and computational ry. DP Okay ~ The question

[Topic] Determine whether the two ring strings are the same. [Idea] Copy the matching string to the end and use the pattern string as KMP. If it can be found, it indicates the same string. I haven't written KMP for a long time, and I forgot about

Question. But I still had wa several times. It turned out to be initialization issues. That's all. Think clearly. Go to the canteen to buy food. The most expensive thing is to swipe your card. Keep the refresh and try to make the remaining 5 yuan as