![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj
文章平均质量分 83
三级头不怕通
这个作者很懒,什么都没留下…
展开
-
POJ1084 DLX 摧毁火柴棒
#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int maxn=360000; const int maxc=500; const原创 2017-09-30 05:42:20 · 416 阅读 · 0 评论 -
待思考, poj3304 线段投影
Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15647 Accepted: 4970 DescriptionGiven n segments in the two dimensional space, write a program, which determines if th原创 2017-10-11 11:34:05 · 234 阅读 · 0 评论 -
POJ1020 分蛋糕
Anniversary Cake Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17496 Accepted: 5708 Description Nahid Khaleh decides to invite the kids of the "Shahr-e G原创 2017-10-27 23:50:21 · 529 阅读 · 0 评论 -
POJ2104 K-th number主席树
也就这样吧 主席树的本质是很多棵形态完全相同的线段树; 既然形态完全相同,那么每个节点就可以做减法; 权值线段树如何求第k大这个默认你已经会了; n个数求区间第k大,相当于有n个权值线段树,举个例子,比如[1,2,3]这个序列,插入过程中会形成三棵树,三棵树里面存储的权值分别是酱紫的,[1],[1,2],[1,2,3],求[2,3]区间第k大就是第3棵树-第1棵树; 按照上面的方式建树肯定会爆...原创 2018-08-17 21:49:23 · 117 阅读 · 0 评论 -
dinic复习 poj1273
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions:85327 Accepted: 33196 Description Every time it rains on Farmer John's fields, a pond forms over Bessie...原创 2018-08-30 20:07:12 · 89 阅读 · 0 评论 -
POJ1459 Power Network Dinic最大流当前弧优化
参考:https://blog.csdn.net/Floatiy/article/details/80961870 Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions:30761 Accepted: 15835 Description A power netwo...原创 2018-08-31 09:07:27 · 148 阅读 · 0 评论 -
POJ2001 Shortest Prefixes 字典树
Shortest Prefixes Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 21761 Accepted: 9320 Description A prefix of a string is a substring starting at the beginning of ...原创 2018-09-21 13:56:57 · 128 阅读 · 0 评论