摘要：之前做过 区间更新的 所以这个做起来要容易些 算是线段树的水题吧都是基本操作 直接贴代码#include#include#define Size 200000using namespace std;struct node{ int L, R, Score; int Max... 阅读全文

摘要：#include#includeusing namespace std;#define Size 100000struct Node{ int L, R; long long Sum, Inc; int Mid() { ... 阅读全文

摘要：#include#include#includeusing namespace std;#define Size 50000struct node{ int L, R, V; node* lchild; node* rchild;}Tree[2*Size];... 阅读全文

摘要：#include#includeusing namespace std;const int INF = 0xffffff0;int MIN = INF;int MAX = -INF;struct Node{ int L, R; int Max, Min; i... 阅读全文