08 2017 档案

ZOJ2532判断边是否是割集中的边
摘要：CIA headquarter collects data from across the country through its classified network. They have been using optical fibres long before it's been deploy 阅读全文
posted @ 2017-08-31 11:50 Billyshuai 阅读(177) 评论(0) 推荐(0)
poj2455 k条路最小化最长边
摘要：Secret Milking Machine Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12414 Accepted: 3625 Description Farmer John is constructing a new m 阅读全文
posted @ 2017-08-28 20:31 Billyshuai 阅读(127) 评论(0) 推荐(0)
乘法逆元模板
摘要：1256 乘法逆元 基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题 收藏 关注 取消关注 收藏 关注 取消关注 给出2个数M和N(M < N)，且M与N互质，找出一个数K满足0 < K < N且K * M % N = 1，如果有多个满足条件的，输出最小的。 给出2个数M 阅读全文
posted @ 2017-08-21 15:17 Billyshuai 阅读(164) 评论(0) 推荐(0)
poj1699 KMP+壮压DP
摘要：Best Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6338 Accepted: 2461 Description The twenty-first century is a biology-technol 阅读全文
posted @ 2017-08-21 00:46 Billyshuai 阅读(273) 评论(0) 推荐(0)
poj3376 KMP+字典树求回文串数量(n*n)
摘要：Finding Palindromes Time Limit: 10000MS Memory Limit: 262144K Total Submissions: 4043 Accepted: 746 Case Time Limit: 2000MS Description A word is call 阅读全文
posted @ 2017-08-20 22:32 Billyshuai 阅读(193) 评论(0) 推荐(0)
hdu6153KMP
摘要：A Secret Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 612 Accepted Submission(s): 237 Proble 阅读全文
posted @ 2017-08-19 22:35 Billyshuai 阅读(206) 评论(0) 推荐(0)
hdu4746莫比乌斯反演进阶题
摘要：Mophues Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 327670/327670 K (Java/Others)Total Submission(s): 1922 Accepted Submission(s): 791 Proble 阅读全文
posted @ 2017-08-18 13:28 Billyshuai 阅读(207) 评论(0) 推荐(0)
hdu6134莫比乌斯反演的经典操作及容斥性
摘要：题解:设f[i]为1-i所有的数被i除后向下取整总和,F[i]为1-i所有数被i除以后向上取整的总和最后满足一个关系： F[i]=f[i-1]+i; f[i]=F[i]-i+cnt(cnt为i因子个数) 这里我让f[i]=F[i]重复使用 F[i]=F[i]-F[i/p]{p是i的所有质数因子}那么 阅读全文
posted @ 2017-08-17 22:18 Billyshuai
欧拉函数 BZOJ2705
摘要：2705: [SDOI2012]Longge的问题 Description Longge的数学成绩非常好，并且他非常乐于挑战高难度的数学问题。现在问题来了：给定一个整数N，你需要求出∑gcd(i, N)(1<=i <=N)。 Longge的数学成绩非常好，并且他非常乐于挑战高难度的数学问题。现在问题 阅读全文
posted @ 2017-08-16 01:03 Billyshuai 阅读(169) 评论(0) 推荐(0)
poj2391 最大流+拆点+二分答案+Floyd
摘要：Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19553 Accepted: 4217 Description FJ's cows really hate getting wet so m 阅读全文
posted @ 2017-08-12 23:18 Billyshuai 阅读(131) 评论(0) 推荐(0)
poj1966枚举源汇点 求最小点割DInic
摘要：Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4854 Accepted: 2241 Description The interconnection of the relays in a cab 阅读全文
posted @ 2017-08-12 21:42 Billyshuai 阅读(153) 评论(0) 推荐(0)
数学题 求因子个数
摘要：小C的倍数问题 Accepts: 1990 Submissions: 4931 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Time Limit: 2000/1000 MS (Jav 阅读全文
posted @ 2017-08-12 17:28 Billyshuai 阅读(390) 评论(0) 推荐(0)
最大流最小割基本
摘要：小Hi：在上一周的Hiho一下中我们初步讲解了网络流的概念以及常规解法，小Ho你还记得内容么？ 小Ho：我记得！网络流就是给定了一张图G=(V,E)，以及源点s和汇点t。每一条边e(u,v)具有容量c(u,v)。网络流的最大流问题求解的就是从s到t最多能有多少流量。 小Hi：那这个问题解决办法呢？ 阅读全文
posted @ 2017-08-12 10:52 Billyshuai 阅读(552) 评论(0) 推荐(0)
poj1149 经典建模
摘要：<!--StartFragment --> <!--StartFragment --> <!--StartFragment --> http://wenku.baidu.com/view/0ad00abec77da26925c5b01c.html 以上内容均为转载 阅读全文
posted @ 2017-08-09 13:26 Billyshuai 阅读(152) 评论(0) 推荐(0)
poj2112 网络流+二分答案
摘要：Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 18083 Accepted: 6460 Case Time Limit: 1000MS Description FJ has moved his K 阅读全文
posted @ 2017-08-09 10:48 Billyshuai 阅读(171) 评论(0) 推荐(0)
hdu6092 01背包
摘要：Rikka with Subset Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 658 Accepted Submission(s): 297 阅读全文
posted @ 2017-08-08 21:11 Billyshuai 阅读(125) 评论(0) 推荐(0)
hdu6090 菊花图
摘要：Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 239 Accepted Submission(s): 157 阅读全文
posted @ 2017-08-08 20:59 Billyshuai 阅读(245) 评论(0) 推荐(0)
poj 2296
摘要：Map Labeler Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2047 Accepted: 682 Description Map generation is a difficult task in cartograph 阅读全文
posted @ 2017-08-07 22:30 Billyshuai 阅读(132) 评论(0) 推荐(0)
poj3683 2-SAT 同上一道
摘要：Priest John's Busiest Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10151 Accepted: 3475 Special Judge Description John is the only p 阅读全文
posted @ 2017-08-07 19:48 Billyshuai 阅读(164) 评论(0) 推荐(0)
poj3648 2-SAT进阶 记录点拓扑
摘要：Wedding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10556 Accepted: 3220 Special Judge Description Up to thirty couples will attend a w 阅读全文
posted @ 2017-08-07 15:25 Billyshuai 阅读(150) 评论(0) 推荐(0)
2-SAT poj3207将边看做点
摘要：Ikki's Story IV - Panda's Trick Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 10238 Accepted: 3762 Description liympanda, one of Ikki’s 阅读全文
posted @ 2017-08-06 16:05 Billyshuai 阅读(141) 评论(0) 推荐(0)
完全背包度度熊与邪恶大魔王
摘要：度度熊与邪恶大魔王 Accepts: 263 Submissions: 1449 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Time Limit: 2000/1000 MS (Ja 阅读全文
posted @ 2017-08-05 13:43 Billyshuai 阅读(141) 评论(0) 推荐(0)
poj3694 连通无向图图加边后有多少桥
摘要：Network Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 10261 Accepted: 3807 Description A network administrator manages a large network. T 阅读全文
posted @ 2017-08-04 13:44 Billyshuai 阅读(148) 评论(0) 推荐(0)
poj3687拓扑排序
摘要：Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14749 Accepted: 4325 Description Windy has N balls of distinct weights from 阅读全文
posted @ 2017-08-04 11:35 Billyshuai 阅读(159) 评论(0) 推荐(0)
poj3249 拓扑找最长路
摘要：Test for Job Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11230 Accepted: 2651 Description Mr.Dog was fired by his company. In order to 阅读全文
posted @ 2017-08-02 16:30 Billyshuai 阅读(147) 评论(0) 推荐(0)
poj3177 无向连通图加多少条边变成边双连通图
摘要：Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15752 Accepted: 6609 Description In order to get from one of the F (1 <= F 阅读全文
posted @ 2017-08-02 15:24 Billyshuai 阅读(382) 评论(0) 推荐(0)
bzoj1497最大闭权图基础题
摘要：1497: [NOI2006]最大获利 Description 新的技术正冲击着手机通讯市场，对于各大运营商来说，这既是机遇，更是挑战。THU集团旗下的CS&T通讯公司在新一代通讯技术血战的前夜，需要做太多的准备工作，仅就站址选择一项，就需要完成前期市场研究、站址勘测、最优化等项目。在前期市场调查和 阅读全文
posted @ 2017-08-02 14:06 Billyshuai 阅读(184) 评论(0) 推荐(0)
最大权闭合子图学习
摘要：hiho 第119周 最大权闭合子图 阅读目录 描述 提示：最大权闭合子图 回到顶部 描述 周末，小Hi和小Ho所在的班级决定举行一些班级建设活动。 根据周内的调查结果，小Hi和小Ho一共列出了N项不同的活动(编号1..N)，第i项活动能够产生a[i]的活跃值。 班级一共有M名学生(编号1..M)， 阅读全文
posted @ 2017-08-02 12:53 Billyshuai 阅读(246) 评论(0) 推荐(0)
HDU 6047 贪心思维题
摘要：Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1797 Accepted Submission(s): 842 阅读全文
posted @ 2017-08-02 11:55 Billyshuai 阅读(113) 评论(0) 推荐(0)