随笔分类 -  线段树

摘要:#include #include #include #include using namespace std;#define N 100002struct node{ int l,r; long long lz,w;}q[4*N];void pushup(int rt){ q[r... 阅读全文
posted @ 2014-08-10 21:12 HuberyQian 阅读(249) 评论(0) 推荐(0)
摘要:http://acm.sdut.edu.cn:8080/vjudge/contest/view.action?cid=221#problem/C#include #includestruct Node{ int sum; int l,r;} node[800001];int num[20... 阅读全文
posted @ 2014-08-08 20:35 HuberyQian 阅读(188) 评论(0) 推荐(0)
摘要:http://acm.sdut.edu.cn:8080/vjudge/contest/view.action?cid=221#problem/A#include #include struct seg{ int l; int r; int sum;}q[2000001];int n... 阅读全文
posted @ 2014-08-08 15:55 HuberyQian 阅读(187) 评论(0) 推荐(0)