差分约束系统
文章平均质量分 84
还是太年轻
这个作者很懒,什么都没留下…
展开
-
POJ 3159 Candies(差分约束系统 spfa+stack)
Candies Time Limit: 1500MS Memory Limit: 131072K Total Submissions:34318 Accepted: 9660 Description During the kindergarten days, flymouse was the monitor of his原创 2018-01-21 23:08:40 · 151 阅读 · 0 评论 -
HDU 1529 Cashier Employment (最经典差分约束系统)
Cashier Employment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1394 Accepted Submission(s): 631 Problem Description A superm原创 2018-01-30 17:54:51 · 311 阅读 · 0 评论 -
HDU 3440 House Man (差分约束系统 从左到右建图)
House Man Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2999 Accepted Submission(s): 1265 Problem Description In Fuzhou, there原创 2018-01-30 19:58:56 · 155 阅读 · 0 评论 -
HDU 1534 Schedule Problem(差分约束系统)
Schedule Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2076 Accepted Submission(s): 941 Special Judge Problem Description原创 2018-01-30 21:58:02 · 596 阅读 · 0 评论 -
HDU 3666 The MATRIX PROBLEM (差分约束系统,除化减)
THE MATRIX PROBLEM Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8855 Accepted Submission(s): 2281 Problem Description You hav原创 2018-01-31 09:02:21 · 143 阅读 · 0 评论 -
POJ 3169 Layout (差分约束系统)
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:12920 Accepted: 6188DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 Some cows原创 2018-01-17 21:12:18 · 128 阅读 · 0 评论 -
POJ 1201 Intervals(差分约束系统)
Intervals Time Limit: 2000MS Memory Limit: 65536K Total Submissions:28274 Accepted: 10899 Description You are given n closed, integer intervals [ai, bi] and n integ原创 2018-01-27 14:38:15 · 241 阅读 · 0 评论 -
HDU 1531 King (差分约束系统 超级源点)
King Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1919 Accepted Submission(s): 897 Problem Description Once, in one kingdom,原创 2018-01-29 21:05:59 · 263 阅读 · 0 评论 -
Wannafly挑战赛9 E 组一组
迪杰斯特拉: 对n个数的每一位分别用差分约束建图,用sum[i]表示前i项的前缀和, 则可以得出几组关系。建图后跑出的d[i]就是sum的一组可行解。 剪枝:如果op=2;则L,R之间的数有的位数就要求都是1。因此可以 建立sum[i]-sum[0]的边来剪枝。 代码: #include #define INF 0x3f3f3f3f using namespace std; const in原创 2018-02-14 14:21:19 · 252 阅读 · 0 评论