04 2016 档案

摘要:时间复杂度仍为o(v^2). 阅读全文
posted @ 2016-04-30 18:50 卷珠帘 阅读(155) 评论(0) 推荐(0) 编辑
摘要:例题:给定长度为n的数列整数a0,a1,a2,a3 ..... an-1以及整数S。求出综合不小于S的连续子序列的长度的最小值。如果解不存在,则输出0。 第一组样例 n=10, S = 15, a = {5,1,3,5,10,7,4,9,2,8}。 尺取法步骤: 1.初始化左定点为0. 2.扩充右定 阅读全文
posted @ 2016-04-23 00:13 卷珠帘 阅读(297) 评论(0) 推荐(0) 编辑
摘要:最近开始学习最短路算法。 单源最短路问题1(Bellman-Ford算法) 不存在负圈时, 最短路不会经过同一顶点两次(也就是说最多通过v-1条边) while(1)最多执行v-1次,时间复杂度o(v*e). 如果存在从s可达的负圈,那么在第v次循环中也会更新d的值,所以可以用来检查负圈。 阅读全文
posted @ 2016-04-20 13:04 卷珠帘 阅读(192) 评论(0) 推荐(0) 编辑
摘要:题目链接:二部图 二部图 时间限制:1000 ms | 内存限制:65535 KB 难度:1 二 部图又叫二分图,我们不是求它的二分图最大匹配,也不是完美匹配,也不是多重匹配,而是证明一个图是不是二部图。证明二部图可以用着色来解决,即我们可以 用两种颜色去涂一个图,使的任意相连的两个顶点颜色不相同, 阅读全文
posted @ 2016-04-19 23:53 卷珠帘 阅读(4340) 评论(0) 推荐(0) 编辑
摘要:题目链接 A. Currency System in Geraldion 有1时,所有大于等于1的数都可由1组成。没有1时,最小不幸的数就是1. 题目链接:B .Gerald is into Art 神之队友,八个if条件秒A,orz... 最后给的两个矩形每个长和宽翻过来倒过去,有四种情况。再和给 阅读全文
posted @ 2016-04-17 12:53 卷珠帘 阅读(629) 评论(2) 推荐(3) 编辑
摘要:敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 69494 Accepted Submission(s): 29214 Problem 阅读全文
posted @ 2016-04-15 19:13 卷珠帘 阅读(476) 评论(0) 推荐(1) 编辑
摘要:Employment Planning Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4782 Accepted Submission(s): 阅读全文
posted @ 2016-04-15 17:05 卷珠帘 阅读(144) 评论(0) 推荐(0) 编辑
摘要:Tickets Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2694 Accepted Submission(s): 1308 Problem 阅读全文
posted @ 2016-04-13 16:42 卷珠帘 阅读(201) 评论(0) 推荐(0) 编辑
摘要:Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31490 Accepted S 阅读全文
posted @ 2016-04-13 15:56 卷珠帘 阅读(317) 评论(0) 推荐(0) 编辑
摘要:FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13643 Accepted Submission(s): 60 阅读全文
posted @ 2016-04-13 12:31 卷珠帘 阅读(684) 评论(0) 推荐(0) 编辑
摘要:FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7576 Accepted Submission(s): 阅读全文
posted @ 2016-04-13 00:17 卷珠帘 阅读(247) 评论(0) 推荐(0) 编辑
摘要:Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11391 Accepted Submission(s): 5 阅读全文
posted @ 2016-04-12 12:51 卷珠帘 阅读(139) 评论(0) 推荐(0) 编辑
摘要:Claris and XOR Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 332 Accepted Submission(s): 135 Pr 阅读全文
posted @ 2016-04-11 00:05 卷珠帘 阅读(371) 评论(0) 推荐(0) 编辑
摘要:Shortest Path Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1494 Accepted Submission(s): 476 阅读全文
posted @ 2016-04-09 20:56 卷珠帘 阅读(262) 评论(0) 推荐(0) 编辑
摘要:B - Fox And Two Dots Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status B - Fox And Two Dots Submit Status Descriptio 阅读全文
posted @ 2016-04-08 00:12 卷珠帘 阅读(329) 评论(0) 推荐(0) 编辑
摘要:Description Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: "Fox"). She heard a rumor: the authors list on t 阅读全文
posted @ 2016-04-07 13:22 卷珠帘 阅读(223) 评论(0) 推荐(0) 编辑
摘要:Problem Description CA is a fine comrade who loves the party and people; inevitably she loves GCD (greatest common divisor) too. Now, there are N diff 阅读全文
posted @ 2016-04-03 00:59 卷珠帘 阅读(315) 评论(0) 推荐(1) 编辑

点击右上角即可分享
微信分享提示