ACM-ICPC
csuhoward
这个作者很懒,什么都没留下…
展开
-
BZOJ 2683: 简单题 离线+CDQ分治
2683: 简单题 Time Limit: 50 Sec Memory Limit: 128 MB Submit: 381 Solved: 163 [Submit][Status][Discuss] Description 你有一个N*N的棋盘,每个格子内有一个整数,初始时的时候全部为0,现在需要维护两种操作: 命令 参数限制 内容原创 2015-10-08 23:02:37 · 1819 阅读 · 0 评论 -
hdu4467 Graph(图的分块)
Graph Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2736 Accepted Submission(s): 443 Problem Description P. T. Tigris is a st原创 2015-10-09 18:10:19 · 1487 阅读 · 0 评论 -
HDU 4466 Triangle (边长a+b+c=M的三角形个数->且gcd(a,b,c)=1的三角形个数)
TriangleTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 627 Accepted Submission(s): 292Problem DescriptionYou have a piece of iron wire wi原创 2015-10-09 21:51:56 · 1912 阅读 · 0 评论 -
BNUOJ39566 Do use segment tree (树链剖分+维护区间最大连续和)
Do use segment tree Given a tree with n (1 ≤ n ≤ 200,000) nodes and a list of q (1 ≤ q ≤ 100,000) queries, process the queries in order and output a value for each output query. The given tree is connec原创 2015-10-11 00:58:50 · 663 阅读 · 0 评论