树状数组
文章平均质量分 87
creatorx
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
2017武汉大学校赛网络预选赛g题
Input file: standard input Output file: standard output Time limit: 1 second Memory limit: 512 mebibytes Everyone hates the verdict “Time Limit Exceeded” or “TLE”. However, sometimes, we can’t com原创 2017-04-10 19:48:17 · 552 阅读 · 0 评论 -
FOJ2277(dfs序 + 树状数组区间更新)
Problem 2277 Change Accept: 91 Submit: 450 Time Limit: 2000 mSec Memory Limit : 262144 KBProblem DescriptionThere is a rooted tree with n nodes, number from 1-n. Root’s number is 1.Each node ha原创 2017-07-31 18:42:12 · 625 阅读 · 0 评论 -
POJ3321(dfs序+树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30177 Accepted: 9013 DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will g原创 2017-07-26 16:51:08 · 535 阅读 · 0 评论 -
HDU6102(树状数组 + 容斥 + 离线处理)
GCDispower Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 141 Accepted Submission(s): 70 Problem Description There is a myster原创 2017-08-12 09:43:08 · 1115 阅读 · 0 评论 -
BZOJ3259(莫比乌斯反演 + 树状数组 + 离散处理 + 极性函数)
3529: [Sdoi2014]数表 Time Limit: 10 Sec Memory Limit: 512 MB Submit: 2049 Solved: 1027 [Submit][Status][Discuss] Description 有一张N×m的数表,其第i行第j列(1 能同时整除i和j的所有自然数之和。给定a,计算数表中不大于a的数之和。 I原创 2017-09-07 19:08:02 · 498 阅读 · 0 评论 -
HDU5542(dp + 树状数组)
The Battle of Chibi Time Limit: 6000/4000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1905 Accepted Submission(s): 669 Problem Description Cao Cao原创 2017-08-30 17:04:32 · 370 阅读 · 0 评论 -
HDU4947(莫比乌斯反演 + 树状数组维护)
GCD Array Time Limit: 11000/5500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1445 Accepted Submission(s): 430 Problem Description Teacher Mai finds th原创 2017-09-08 21:01:38 · 451 阅读 · 0 评论 -
POJ1195(树状数组)
Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 20799 Accepted: 9619 Description Suppose that the fourth generation mobile phone base station原创 2017-10-10 16:40:33 · 873 阅读 · 0 评论
分享