- 博客(9)
- 收藏
- 关注
RSS订阅原创 练习四 1009
4 1009Problem ITime Limit : 5000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 19 Accepted Submission(s) : 8Problem Description在每年的校赛里，所有进入决赛的同学
2016-06-18 23:21:02
166
原创 练习四 1006
4 1006Problem FTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 3Problem DescriptionThe Head Elder of
2016-06-18 23:19:48
312
原创 练习四 1005
4 1005Problem ETime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 2Problem Description省政府“畅通工程”的目标是使全省任何
2016-06-18 23:16:59
280
原创 练习四 1004
4 1004Problem DTime Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 4Problem Description某省调查乡村交通状况，得到的统计表中
2016-06-18 23:15:49
215
原创 练习四 1003
4 1003Problem CTime Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 23 Accepted Submission(s) : 10Problem Description某省调查城镇交通状况，得到现有城
2016-06-18 23:13:56
175
原创 练习四 1002
Problem BTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 58 Accepted Submission(s) : 18Problem DescriptionEddy begins to l
2016-06-18 23:12:18
172
原创 练习四 1001
题意:给出n个城市间的距离，和m对已经联通的城市，问最少需要建设多少道路把所有城市联通。思路:最小生成树问题，注意在把城市之间的距离转化成邻接表时避免超时，把已经联通的城市合并。只需要取矩阵中j>i的部分。代码:#include#include#includeusing namespace std;int p[10010],n,m,k;str
2016-06-18 23:05:22
253
原创 HDOJ1257
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32660 Accepted Submission(s): 12852Problem Description某国为了防御敌国的导弹袭击,发
2016-06-18 23:03:26
135
原创 HDOJ1019
Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45020 Accepted Submission(s): 16916Problem Description
2016-06-18 23:01:24
257
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人