摘要: 34772K 63MS#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>using namespace std;struct post{ int head; int tail;}p[10010];struct node{ node *left; node *right; int L; int R; bool bcover;};node tree[1000000];int npoint;int endpoint[ 阅读全文
posted @ 2012-07-17 10:50 willzhang 阅读(144) 评论(0) 推荐(0) 编辑
摘要: 空间8220K 时间3344MS瞻仰时间在1000ms内的神#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>using namespace std;struct node{ __int64 L; __int64 R; node *left; node *right; __int64 sum; __int64 inc;};__int64 ncount=0;node tree[200010];void build 阅读全文
posted @ 2012-07-17 09:17 willzhang 阅读(104) 评论(0) 推荐(0) 编辑