三水的鱼塘♂

饭卡 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 29650    Accepted Submission(s): 10215 Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24144    Accepted Submission(s): 8915 Problem Description The aspiring Roy th

I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28794    Accepted Submission(s): 11689 Problem Description Speakless很早就

Bone Collector Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 56   Accepted Submission(s) : 36 Font: Times New Roman | Verdana | Georgia F

Big Event in HDU Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 48   Accepted Submission(s) : 27 Font: Times New Roman | Verdana | Georgia

http://acm.hdu.edu.cn/showproblem.php?pid=6092 #include #include using namespace std; #define ma(a) memset((a),0,sizeof((a))) int dp[11111],num[11111],a[11111],ans[11111]; int main(){

http://172.21.2.10/JudgeOnline/problem.php?id=2236 #include #include #include #include using namespace std; int main(){ int n,m;int dp[111111]; int d

http://acm.hdu.edu.cn/showproblem.php?pid=3466 #include #include #include #include using namespace std; struct node { int w,q,v; }ite[11111]; int dp[11111]; int n; int m;