随笔分类 - 线段树
摘要:#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...
阅读全文
摘要: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...
阅读全文
摘要: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...
阅读全文

浙公网安备 33010602011771号