Others

Orc has learned to tell us that it is too difficult to find a mistake at ordinary times. Here, I will post it first... No, it's too outdated. # Include # include int main () {freopen ("myin.txt", "r", stdin); freopen ("myout.txt", "W", stdout);

It's cool ~~ Actually, the sum of the longest non-downgrading sub-sequence and longest non-ascending sub-Sequence starting from a certain point minus the repeated numbers in the two ~ # Include # include # include using namespace STD; const

Link: http://acm.sgu.ru/problem.php? Contest = 0 & problem = 195 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 26733 # Problem/e195. New Year bonus granttime limit per test: 1.5 sec. Memory limit per test: 65536 kbinput: Standard Output:

Question: You can buy up to one n different items. Each item corresponds to two PI di values. Pi indicates the value of the item, di indicates the latest time that can be bought (that is, the first day to the day that Di can buy this item) Rule: you

Question: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4414 Csust: Click to open the link Finding Crosses Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 729 accepted submission (s):

Question: http://poj.org/problem? Id = 2965 Source: http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 26732 # Problem/B. It refers to turning all the state diagrams in the question ---- ---- ---- ---- State flip: each time one is flipped, the

# Include # Include Int main (){ Int I, d, J, D1;Char A [100]; int B [101] = {0}; int C [100] = {0 };// Memset (B, 0, sizeof (B ));// Memset (C, 0, sizeof (c ));Scanf ("% s", );D = strlen ();For (I = D-1, j = 0; I> = 0; I --)B [J ++] = A [I]-'0 ';

Mom, it turns out to be a discrete MATHEMATICAL question, a question, and an equivalent of disjunction, union, non, implication .... Thanks to the end of the final exam, it would be sad ,,,, The general meaning of this question is to determine

Link: http://poj.org/problem? Id = 1321 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 22009 # Problem/D board Problem Time limit:1000 ms   Memory limit:10000 K Total submissions:18942   Accepted:9435

Question: http://acm.hdu.edu.cn/diy/contest_show.php? Cid = 20083 Password: shuacm I feel that new students in their school are better trained. Today, many questions have enhanced the conversion of backpacks. For more information about how to

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

Link: http://poj.org/problem? Id = 3414 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 22009 # Problem/jpots Time limit:1000 ms   Memory limit:65536 K Total submissions:8253   Accepted:3499   Special

The original author cannot find it, but I can see it in the csust blog, a good template. Source of the article I saw (not original): http://blog.csdn.net/csust_acm/article/details/7268029 // Add large numbers # include # include int main ()

The most classic and basic 01 backpack entry questions Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2602 Bone Collector Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 13839

Original: http://blog.163.com/zhaohai_1988/blog/static/209510085201263011135062/ Thanks to the authors and the recommendations of kb ~~~~~~ Problem description The rmq problem is the most important problem in the given range. For the number of

A simple and silly program for imitation writing, linear table entry... I hope that these programs will be completed and a simple system can be created /*************************************** * *** Experiment content 2: 1. use C language to define

/* Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1026 Ignatius and the princess I Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 9969 accepted submission (s): 2989Special Judge Problem

Link: http://acm.hdu.edu.cn/showproblem.php? PID = 3874 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 28619 # Problem/aneck.pdf Time Limit: 15000/5000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 1957

Original question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1022 Train problem I Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 13410 accepted submission (s): 4935Problem

Original question link: http://poj.org/problem? Id = 3928 My link: http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 20357 # Problem/ Ping pong Time limit:1000 ms   Memory limit:65536 K Total submissions:1215