上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 57 下一页
摘要: Building designing Time limit: 3.000 seconds An architect wants to design a very high building. The building will consist of some floors, and each floor 阅读全文
posted @ 2017-07-15 15:36 ZERO- 阅读(350) 评论(0) 推荐(0)
摘要: Hello World! Time limit: 1.000 seconds When you first made the computer to print the sentence “Hello World!”, you felt so happy, not knowing how comple 阅读全文
posted @ 2017-07-15 15:28 ZERO- 阅读(424) 评论(0) 推荐(0)
摘要: Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22789 Accepted Submission(s): 10 阅读全文
posted @ 2017-07-12 21:45 ZERO- 阅读(216) 评论(0) 推荐(0)
摘要: 最短路 Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) 在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的T-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却 阅读全文
posted @ 2017-07-12 21:42 ZERO- 阅读(842) 评论(2) 推荐(0)
摘要: 哈密顿绕行世界问题 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7419 Accepted Submission(s): 4403 Probl 阅读全文
posted @ 2017-07-12 17:50 ZERO- 阅读(221) 评论(0) 推荐(0)
摘要: Guilty Prince Memory Limit: 32 MB Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to l 阅读全文
posted @ 2017-07-12 17:45 ZERO- 阅读(227) 评论(0) 推荐(0)
摘要: C. Socks time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Socks time limit per test 2 阅读全文
posted @ 2017-07-12 17:01 ZERO- 阅读(532) 评论(7) 推荐(0)
摘要: wtmsb Time Limit: 1000/100MS (Java/Others) Memory Limit: 131072/131072KB (Java/Others) 这天,AutSky_JadeKAutSky_JadeK 看到了n张图片,他忍不住说道:“我TM 社保!”。每张图片有一个社保值 阅读全文
posted @ 2017-07-12 15:24 ZERO- 阅读(313) 评论(0) 推荐(1)
摘要: Sqrt Bo Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2222 Accepted Submission(s): 883 Proble 阅读全文
posted @ 2017-07-12 12:23 ZERO- 阅读(296) 评论(6) 推荐(0)
摘要: 备忘。 差分数组: 区间更新查询有很多方法,线段树、树状数组等都可以。如果为离线查询,就可以考虑使用差分数组。 假设对于区间[l,r]的每个数都加1,我们用一个数组a来记录,a[l]+=1;a[r+1]-=1; 然后使用一个数组ans来记录数组a的前缀和,ans[i]=ans[i-1]+a[i];a 阅读全文
posted @ 2017-07-08 00:17 ZERO- 阅读(304) 评论(0) 推荐(0)
上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 57 下一页