摘要：http://acm.fzu.edu.cn/problem.php?pid=1894Problem 1894 志愿者选拔Accept: 1328Submit: 4200Time Limit: 1500 mSecMemory Limit : 32768 KBProblem Description世博会... 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=4006The kth great numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 5478Accepted Submission(s): 2241Problem DescriptionXiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1896题目意思待理解！！！StonesTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 698Accepted Submission(s): 421Problem DescriptionBecause of the wrong status of the bicycle, Sempr begin to walk east to west every mornin 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1873真的不难，唉，可我还是参考了别人的代码，真心希望看到这篇的你自己写完这题，摆脱依赖！Problem Description看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高，级别为1的优先权最低。医生在看病时，则会在他的队伍里面选择一个优先权最高的人进行诊治。如果遇到两个优先权一样的 阅读全文

摘要：题目地址：http://poj.org/problem?id=1028DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reached by moving backward and forward. In this problem, 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=1022http://blog.csdn.net/swm8023/article/details/6902426此处分类题hdu1022题copy代码#include#include#definemax100usingnamespacestd;intmain(){stacks;intn,i,j,k,result[max];//n为列车个数，result数组用来表示结果，1表示进栈。0表示出charstr1[max],str2[max];//序列1和序列2while(cin>>n>>str 阅读全文