上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 15 下一页
摘要: Gold MineTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2374Accepted Submission(s): 514Problem De... 阅读全文
posted @ 2015-08-03 20:32 下周LGD该赢了吧 阅读(257) 评论(0) 推荐(0) 编辑
摘要: Road constructionsTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1470Accepted Submission(s): 485P... 阅读全文
posted @ 2015-08-03 17:00 下周LGD该赢了吧 阅读(171) 评论(0) 推荐(0) 编辑
摘要: FiringTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 8952Accepted: 2690DescriptionYou’ve finally got mad at “the world’s most stupid” emplo... 阅读全文
posted @ 2015-08-03 16:47 下周LGD该赢了吧 阅读(226) 评论(0) 推荐(0) 编辑
摘要: Destroying The GraphTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7570Accepted: 2423Special JudgeDescriptionAlice and Bob play the followin... 阅读全文
posted @ 2015-08-02 12:02 下周LGD该赢了吧 阅读(179) 评论(0) 推荐(0) 编辑
摘要: 方格取数(2)Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5425Accepted Submission(s): 1695Problem De... 阅读全文
posted @ 2015-08-02 10:15 下周LGD该赢了吧 阅读(179) 评论(0) 推荐(0) 编辑
摘要: 最短路Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 38804Accepted Submission(s): 16925Problem Descr... 阅读全文
posted @ 2015-05-21 20:17 下周LGD该赢了吧 阅读(156) 评论(0) 推荐(0) 编辑
摘要: A Simple Problem with IntegersTime Limit:5000MSMemory Limit:131072KTotal Submissions:70937Accepted:21874Case Time Limit:2000MSDescriptionYou haveNinte... 阅读全文
posted @ 2015-04-24 17:19 下周LGD该赢了吧 阅读(104) 评论(0) 推荐(0) 编辑
摘要: 敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52815Accepted Submission(s): 22123Problem Desc... 阅读全文
posted @ 2015-04-24 16:07 下周LGD该赢了吧 阅读(136) 评论(0) 推荐(0) 编辑
摘要: I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45514Accepted Submission(s): 17865Problem... 阅读全文
posted @ 2015-04-24 16:05 下周LGD该赢了吧 阅读(134) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3209dancing links 每个点作为一列。每个块作为一行。不知道为什么插节点的时候 如果把循环写成for(int i = y1+1; i 2 #inclu... 阅读全文
posted @ 2015-04-24 00:54 下周LGD该赢了吧 阅读(136) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 15 下一页