线段树
疯的世界
这个作者很懒,什么都没留下…
展开
-
线段树 模版
#include #include using namespace std; const int maxn=100002; int sum[maxn*4]={0};//这个要初始化为0 int col[maxn*4]={0};//标记每个节点,初始化为0 //将子节点的数据传到根节点 void PushUp(int rt) {//存放节点的总和 sum[rt]=sum[rt*2]+su原创 2012-08-10 00:15:11 · 906 阅读 · 0 评论 -
hdu_1166 Counting Black
Counting Black Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8951 Accepted: 5775 题目链接:http://poj.org/problem?id=1656 Description There is a boar原创 2012-07-27 16:26:22 · 818 阅读 · 0 评论 -
poj_3468 A Simple Problem with Integers
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 31675 Accepted: 8989 Case Time Limit: 2000MS 题目链原创 2012-07-27 16:22:31 · 778 阅读 · 0 评论 -
poj_3264 Balanced Lineup
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 23380 Accepted: 10882 Case Time Limit: 2000MS 题目链接:http://poj.org/problem?i原创 2012-07-31 13:26:27 · 636 阅读 · 0 评论 -
poj_2352 Stars ( 线段树)
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22828 Accepted: 9949 题目链接:http://poj.org/problem?id=2352 Description Astronomers often exami原创 2012-09-01 09:53:53 · 897 阅读 · 0 评论 -
Sliding Window poj 2823
题目链接:http://poj.org/problem?id=2823 Sliding Window Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 29378 Accepted: 8734 Case Time Limit: 5000MS原创 2013-03-23 19:37:18 · 910 阅读 · 0 评论 -
Count Color poj 2777
题目链接:http://poj.org/problem?id=2777 Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 29470 Accepted: 8800 Description Chosen ProblemSol原创 2013-03-23 19:40:52 · 1057 阅读 · 0 评论 -
Frequentvalues poj 3368
题目链接:http://poj.org/problem?id=3368 Frequentvalues Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10917 Accepted: 4004 Description You are given原创 2013-03-23 19:42:33 · 934 阅读 · 0 评论