04 2018 档案

摘要:推荐几篇博客:https://blog.csdn.net/JarjingX/article/details/8521690 研究总结2-sat问题 https://blog.csdn.net/whereisherofrom/article/details/79417926 有向图强连通+2-sat问 阅读全文
posted @ 2018-04-27 20:15 HDU_jackyan 阅读(360) 评论(0) 推荐(0)
摘要:推荐几个比较好的博客:https://blog.csdn.net/whereisherofrom/article/details/78922648 最短路和差分约束 http://www.cnblogs.com/void/archive/2011/08/26/2153928.html 差分约数系统详 阅读全文
posted @ 2018-04-23 20:19 HDU_jackyan 阅读(1043) 评论(1) 推荐(0)
摘要:推荐几个博客:https://blog.csdn.net/dm_vincent/article/details/7714519 拓扑排序的原理及其实现 https://blog.csdn.net/u012860063/article/details/38017661 拓扑排序的几种写法 https: 阅读全文
posted @ 2018-04-21 22:02 HDU_jackyan 阅读(456) 评论(0) 推荐(0)
摘要:推荐博客:http://hzwer.com/8053.html 分块入门题库:https://loj.ac/problems/search?keyword=%E5%88%86%E5%9D%97 分块1:给出一个长为n的数列,以及n个操作,操作涉及区间加法,单点查值。 1 #include<cstdi 阅读全文
posted @ 2018-04-18 22:23 HDU_jackyan 阅读(1251) 评论(0) 推荐(1)
摘要:推荐几篇文章:https://blog.csdn.net/strangedbly/article/details/51137432(SG函数详细介绍) https://blog.csdn.net/shahdza/article/details/7832997 博弈题集 SG函数解题模型: 1.把原游 阅读全文
posted @ 2018-04-16 21:46 HDU_jackyan 阅读(641) 评论(0) 推荐(0)
摘要:桥和割点例题+讲解:hihocoder1183 http://hihocoder.com/problemset/problem/1183 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 #include<vector> 5 阅读全文
posted @ 2018-04-13 18:46 HDU_jackyan 阅读(243) 评论(0) 推荐(0)
摘要:tarjan模板 1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 using namespace std; 5 const int maxn=20010; 6 const int maxm=50010; 7 struct 阅读全文
posted @ 2018-04-09 21:41 HDU_jackyan 阅读(1174) 评论(0) 推荐(0)
摘要:推荐几个博客:https://blog.csdn.net/int64ago/article/details/7429868搞懂树状数组 https://blog.csdn.net/z309241990/article/details/9615259区间修改 https://blog.csdn.net 阅读全文
posted @ 2018-04-04 15:50 HDU_jackyan 阅读(281) 评论(0) 推荐(0)