ZOJ
文章平均质量分 87
EIKY
这个作者很懒,什么都没留下…
展开
-
ZOJ-3469-Food Delivery(区间DP)
Description When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery. Suppose there are原创 2016-04-16 14:47:01 · 489 阅读 · 0 评论 -
ZOJ-3868-GCD Expectation(容斥)
GCD Expectation Time Limit: 4 Seconds Memory Limit: 262144 KB Edward has a set of n integers {a1, a2,...,an}. He randomly picks a nonempty subset {x1, x2,…,xm} (each nonempty subset h原创 2016-05-08 14:11:49 · 552 阅读 · 0 评论 -
ZOJ-3946-Highway Project(最短路)
Highway Project Time Limit: 2 Seconds Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from原创 2016-04-24 13:36:05 · 536 阅读 · 1 评论 -
ZOJ-3939-The Lucky Week(日期循环节)
The Lucky Week Time Limit: 2 Seconds Memory Limit: 65536 KB Edward, the headmaster of the Marjar University, is very busy every day and always forgets the date. There was one day Ed原创 2016-04-24 17:19:38 · 610 阅读 · 0 评论 -
ZOJ-2676-Network Wars(01分数规划+最小割)
链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1676 while( ( t=DFS(S,T,INF) ) >=eps)没加括弧wa到哭 //#pragma comment(linker, "/STACK:1024000000,1024000000") #include #includ原创 2017-04-18 19:25:20 · 370 阅读 · 0 评论 -
ZOJ-3963-Heap Partition(贪心)(STL)
链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5595 大致题意:用给出的数列a1,a2,a3....an构造二叉树,满足对于下标i和j,有i 正序建树模拟一下,找到小于等于当前权值的一个可插入最大值,成为其子节点,找不到则新建树。 #include using namespace std;原创 2017-04-25 19:08:52 · 709 阅读 · 0 评论