ChasingWaves

//906MS 1972K#include #include #include #include #define lch(x) ((x)<<1)#define rch(x) ((x)<<1 | 1)using namespace std;const int maxn = 100000;int num[maxn+5];int tree[maxn<<2];bool flag[m

把第一个数拿到最后去，逆序数的

//5580K 2516MS#include #include #include #include #define lch(x) ((x)<<1)#define rch(x) ((x)<<1 | 1)using namespace std;typedef long long LL;const int MAX_N = 100000;LL a[MAX_N+5];LL del[

//#include #include #include #include #define lch(n) ((n)<<1)#define rch(n) ((n)<<1 | 1)using namespace std;typedef long long LL;const int MAX_N = int(1e5);LL sum[MAX_N<<2], add[MAX_N<<2];

机房网络好了，现在把博文补上

//781MS 2388K#include #include #include #include #define lch(x) ((x)<<1)#define rch(x) ((x)<<1|1)using namespace std;typedef long long LL;const int MAX_N = int(1e5);int sum[MAX_N<<2], tag[

//1472K 63MS#include #include #include #include #define lch(n) ((n)<<1)#define rch(n) ((n)<<1|1)using namespace std;const int MAX_N = int(1e4);bool vis[MAX_N+5];int li[MAX_N+5], ri[MAX_N+5

//1093MS 4492K#include #include #include #include #define lch(x) ((x)<<1)#define rch(x) ((x)<<1 | 1)using namespace std;const int MAX_N = 200000;int tree[MAX_N<<2], a[MAX_N<<1];int N, N2, M

全部采用扩展区间

There are n numbers a_1,a_2,...,a_n on a line, everytime you can change every number in a segment [l,r] into a number x(type 1), or change every number a_i in a segment [l,r] which is bigger than x to

Problem DescriptionThe wall was divided into N segments and the width of each segment was one cun(cun is a Chinese length unit). All segments were numbered from 1 to N, from left to right. There w