Created
October 22, 2013 03:07
-
-
Save lychees/7094603 to your computer and use it in GitHub Desktop.
http://www.spoj.com/ranks/SEQ2/
伸展树，MSS，内存回收
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Sep. 22th 2013 **/ //{ | |
| /** Header .. **/ //{ | |
| #pragma comment(linker, "/STACK:36777216") | |
| //#pragma GCC optimize ("O2") | |
| #define LOCAL | |
| //#include "testlib.h" | |
| #include <functional> | |
| #include <algorithm> | |
| #include <iostream> | |
| #include <fstream> | |
| #include <sstream> | |
| #include <iomanip> | |
| #include <numeric> | |
| #include <cstring> | |
| #include <climits> | |
| #include <cassert> | |
| #include <complex> | |
| #include <cstdio> | |
| #include <string> | |
| #include <vector> | |
| #include <bitset> | |
| #include <queue> | |
| #include <stack> | |
| #include <cmath> | |
| #include <ctime> | |
| #include <list> | |
| #include <set> | |
| #include <map> | |
| //#include <tr1/unordered_set> | |
| //#include <tr1/unordered_map> | |
| //#include <array> | |
| using namespace std; | |
| #define REP(i, n) for (int i=0;i<int(n);++i) | |
| #define FOR(i, a, b) for (int i=int(a);i<int(b);++i) | |
| #define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i) | |
| #define REP_1(i, n) for (int i=1;i<=int(n);++i) | |
| #define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i) | |
| #define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i) | |
| #define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i) | |
| #define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i) | |
| #define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i) | |
| #define REP_N(i, n) for (i=0;i<int(n);++i) | |
| #define FOR_N(i, a, b) for (i=int(a);i<int(b);++i) | |
| #define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i) | |
| #define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i) | |
| #define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i) | |
| #define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i) | |
| #define REP_1_N(i, n) for (i=1;i<=int(n);++i) | |
| #define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i) | |
| #define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i) | |
| #define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i) | |
| #define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i) | |
| #define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i) | |
| #define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i) | |
| #define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i) | |
| #define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i) | |
| #define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it) | |
| #define REP_S(i, str) for (char*i=str;*i;++i) | |
| #define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i]) | |
| #define REP_G(i, u) REP_L(i,hd[u],suc) | |
| #define REP_SS(x, s) for (int x=s;x;x=(x-1)&s) | |
| #define DO(n) for ( int ____n = n; ____n-->0; ) | |
| #define REP_2(i, j, n, m) REP(i, n) REP(j, m) | |
| #define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m) | |
| #define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l) | |
| #define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l) | |
| #define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn) | |
| #define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn) | |
| #define ALL(A) A.begin(), A.end() | |
| #define LLA(A) A.rbegin(), A.rend() | |
| #define CPY(A, B) memcpy(A, B, sizeof(A)) | |
| #define INS(A, P, B) A.insert(A.begin() + P, B) | |
| #define ERS(A, P) A.erase(A.begin() + P) | |
| #define BSC(A, x) (lower_bound(ALL(A), x) - A.begin()) | |
| #define CTN(T, x) (T.find(x) != T.end()) | |
| #define SZ(A) int((A).size()) | |
| #define PB push_back | |
| #define MP(A, B) make_pair(A, B) | |
| #define PTT pair<T, T> | |
| #define Ts *this | |
| #define rTs return Ts | |
| #define fi first | |
| #define se second | |
| #define re real() | |
| #define im imag() | |
| #define Rush for(int ____T=RD(); ____T--;) | |
| #define Display(A, n, m) { \ | |
| REP(i, n){ \ | |
| REP(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m-1] << endl; \ | |
| } \ | |
| } | |
| #define Display_1(A, n, m) { \ | |
| REP_1(i, n){ \ | |
| REP_1(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m] << endl; \ | |
| } \ | |
| } | |
| typedef long long LL; | |
| //typedef long double DB; | |
| typedef double DB; | |
| typedef unsigned uint; | |
| typedef unsigned long long uLL; | |
| typedef vector<int> VI; | |
| typedef vector<char> VC; | |
| typedef vector<string> VS; | |
| typedef vector<LL> VL; | |
| typedef vector<DB> VF; | |
| typedef set<int> SI; | |
| typedef set<string> SS; | |
| typedef map<int, int> MII; | |
| typedef map<string, int> MSI; | |
| typedef pair<int, int> PII; | |
| typedef pair<LL, LL> PLL; | |
| typedef vector<PII> VII; | |
| typedef vector<VI> VVI; | |
| typedef vector<VII> VVII; | |
| template<class T> inline T& RD(T &); | |
| template<class T> inline void OT(const T &); | |
| //inline int RD(){int x; return RD(x);} | |
| inline LL RD(){LL x; return RD(x);} | |
| inline DB& RF(DB &); | |
| inline DB RF(){DB x; return RF(x);} | |
| inline char* RS(char *s); | |
| inline char& RC(char &c); | |
| inline char RC(); | |
| inline char& RC(char &c){scanf(" %c", &c); return c;} | |
| inline char RC(){char c; return RC(c);} | |
| //inline char& RC(char &c){c = getchar(); return c;} | |
| //inline char RC(){return getchar();} | |
| template<class T> inline T& RDD(T &); | |
| inline LL RDD(){LL x; return RDD(x);} | |
| template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;} | |
| template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;} | |
| template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;} | |
| template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);} | |
| template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);} | |
| template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);} | |
| inline char& RC(char &a, char &b){RC(a), RC(b); return a;} | |
| inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;} | |
| inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;} | |
| inline void RS(char *s1, char *s2){RS(s1), RS(s2);} | |
| inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);} | |
| template<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);} | |
| template<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);} | |
| template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));} | |
| template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));} | |
| template<class T> inline void CLR(T &A){A.clear();} | |
| template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);} | |
| template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);} | |
| template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);} | |
| template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);} | |
| template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);} | |
| template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();} | |
| template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);} | |
| template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);} | |
| template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);} | |
| template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);} | |
| template<class T> inline bool EPT(T &a){return a.empty();} | |
| template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;} | |
| template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;} | |
| template<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;} | |
| template<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;} | |
| template<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);} | |
| //} | |
| /** Constant List .. **/ //{ | |
| const int MOD = int(1e9) + 7; | |
| //int MOD = 99990001; | |
| const int INF = 0x3f3f3f3f; | |
| const LL INFF = 0x3f3f3f3f3f3f3f3fLL; | |
| const DB EPS = 1e-9; | |
| const DB OO = 1e20; | |
| const DB PI = acos(-1.0); //M_PI; | |
| const int dx[] = {-1, 0, 1, 0}; | |
| const int dy[] = {0, 1, 0, -1}; | |
| //} | |
| /** Add On .. **/ //{ | |
| // <<= '0. Nichi Joo ., //{ | |
| template<class T> inline T& checkMin(T &a,const T b){if (b<a) a=b;return a;} | |
| template<class T> inline T& checkMax(T &a,const T b){if (a<b) a=b;return a;} | |
| template<class T> inline T& checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);return a;} | |
| template<class T> inline T& checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);return a;} | |
| template <class T, class C> inline T& checkMin(T& a, const T b, C c){if (c(b,a)) a = b;return a;} | |
| template <class T, class C> inline T& checkMax(T& a, const T b, C c){if (c(a,b)) a = b;return a;} | |
| template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);} | |
| template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);} | |
| template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));} | |
| template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));} | |
| template<class T> inline T sqr(T a){return a*a;} | |
| template<class T> inline T cub(T a){return a*a*a;} | |
| template<class T> inline T ceil(T x, T y){return (x - 1) / y + 1;} | |
| template<class T> T abs(T x){return x>0?x:-x;} | |
| inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;} | |
| inline int sgn(DB x, DB y){return sgn(x - y);} | |
| inline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))/(2*a*b);} | |
| inline DB cot(DB x){return 1./tan(x);}; | |
| inline DB sec(DB x){return 1./cos(x);}; | |
| inline DB csc(DB x){return 1./sin(x);}; | |
| //} | |
| // <<= '1. Bitwise Operation ., //{ | |
| namespace BO{ | |
| inline bool _1(int x, int i){return bool(x&1<<i);} | |
| inline bool _1(LL x, int i){return bool(x&1LL<<i);} | |
| inline LL _1(int i){return 1LL<<i;} | |
| inline LL _U(int i){return _1(i) - 1;}; | |
| inline int reverse_bits(int x){ | |
| x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa); | |
| x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc); | |
| x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0); | |
| x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00); | |
| x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000); | |
| return x; | |
| } | |
| inline LL reverse_bits(LL x){ | |
| x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL); | |
| x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL); | |
| x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL); | |
| x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL); | |
| x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL); | |
| x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL); | |
| return x; | |
| } | |
| template<class T> inline bool odd(T x){return x&1;} | |
| template<class T> inline bool even(T x){return !odd(x);} | |
| template<class T> inline T low_bit(T x) {return x & -x;} | |
| template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;} | |
| template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;} | |
| template<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;} | |
| inline int clz(int x){return __builtin_clz(x);} | |
| inline int clz(LL x){return __builtin_clzll(x);} | |
| inline int ctz(int x){return __builtin_ctz(x);} | |
| inline int ctz(LL x){return __builtin_ctzll(x);} | |
| inline int lg2(int x){return !x ? -1 : 31 - clz(x);} | |
| inline int lg2(LL x){return !x ? -1 : 63 - clz(x);} | |
| inline int low_idx(int x){return !x ? -1 : ctz(x);} | |
| inline int low_idx(LL x){return !x ? -1 : ctz(x);} | |
| inline int high_idx(int x){return lg2(x);} | |
| inline int high_idx(LL x){return lg2(x);} | |
| inline int parity(int x){return __builtin_parity(x);} | |
| inline int parity(LL x){return __builtin_parityll(x);} | |
| inline int count_bits(int x){return __builtin_popcount(x);} | |
| inline int count_bits(LL x){return __builtin_popcountll(x);} | |
| } using namespace BO;//} | |
| //} | |
| /** I/O Accelerator Interface .. **/ //{ | |
| #define g (c=getchar()) | |
| #define d isdigit(g) | |
| #define p x=x*10+c-'0' | |
| #define n x=x*10+'0'-c | |
| #define pp l/=10,p | |
| #define nn l/=10,n | |
| template<class T> inline T& RD(T &x){ | |
| char c;while(!d);x=c-'0';while(d)p; | |
| return x; | |
| } | |
| template<class T> inline T& RDD(T &x){ | |
| char c;while(g,c!='-'&&!isdigit(c)); | |
| if (c=='-'){x='0'-g;while(d)n;} | |
| else{x=c-'0';while(d)p;} | |
| return x; | |
| } | |
| inline DB& RF(DB &x){ | |
| //scanf("%lf", &x); | |
| char c;while(g,c!='-'&&c!='.'&&!isdigit(c)); | |
| if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;} | |
| else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}} | |
| else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;} | |
| else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}} | |
| return x; | |
| } | |
| #undef nn | |
| #undef pp | |
| #undef n | |
| #undef p | |
| #undef d | |
| #undef g | |
| inline char* RS(char *s){ | |
| //gets(s); | |
| scanf("%s", s); | |
| return s; | |
| } | |
| LL last_ans; int Case; template<class T> inline void OT(const T &x){ | |
| //printf("Case #%d: ", ++Case); | |
| //printf("%lld\n", x); | |
| //printf("%.4f\n", x); | |
| printf("%d\n", x); | |
| //cout << x << endl; | |
| //last_ans = x; | |
| } | |
| //} | |
| //}/* .................................................................................................................................. */ | |
| const int N = int(5e5)+9; | |
| int c[2][N],p[N]; | |
| int bj[N],sz[N],ky[N],ss[N],ls[N],rs[N],ms[N]; | |
| int rt,tp,TStack[N],ts; | |
| #define l c[0] | |
| #define r c[1] | |
| #define lx l[x] | |
| #define rx r[x] | |
| void reset(int x,int v){ | |
| l[x]=r[x]=p[x]=bj[x]=0; | |
| ky[x]=v; | |
| } | |
| int new_node(int v){ | |
| int x = ts ? TStack[--ts] : ++tp; | |
| reset(x, v); | |
| return x; | |
| } | |
| inline void rev(int x){bj[x]^=1,swap(lx,rx),swap(ls[x],rs[x]);} | |
| inline void sss(int x){bj[x]|=2,ss[x]=sz[x]*ky[x],ms[x]=ls[x]=rs[x]=ky[x]<0?ky[x]:ss[x];} | |
| inline void upd(int x){ | |
| assert(x); | |
| sz[x] = sz[lx] + 1 + sz[rx]; | |
| ss[x] = ss[lx] + ky[x] + ss[rx]; | |
| ls[x] = max(ls[lx],ss[lx]+ky[x]+max(0,ls[rx])); | |
| rs[x] = max(rs[rx],ss[rx]+ky[x]+max(0,rs[lx])); | |
| ms[x] = max(ms[lx],max(0,rs[lx])+ky[x]+max(0,ls[rx]), ms[rx]); | |
| } | |
| inline void rls(int x){ | |
| assert(x); | |
| if (bj[x]){ | |
| if (bj[x]&1)rev(lx),rev(rx); | |
| if (bj[x]&2)ky[lx]=ky[rx]=ky[x],sss(lx),sss(rx); | |
| bj[x]=0; | |
| } | |
| } | |
| inline int sgn(int x){return r[p[x]]==x;} | |
| inline void setc(int x, int d, int y){p[c[d][x]=y]=x;} | |
| inline void setl(int x, int y){setc(x,0,y);} | |
| inline void setr(int x, int y){setc(x,1,y);} | |
| inline void rot(int x, int d){ | |
| int y=p[x],z=p[y];setc(z,sgn(y),x); | |
| setc(y,d,c[!d][x]),setc(x,!d,y),upd(y); | |
| } | |
| inline void rot(int x){rot(x,sgn(x));} | |
| //inline void fix(int x){if(~sgn(x))fix(p[x]);rls(x);} | |
| inline int splay(int x,int t=0){ | |
| int a,b,y;while ((y=p[x])!=t){ | |
| if (p[y]==t){rot(x);break;} | |
| else a=sgn(x),b=sgn(y),rot(a^b?x:y,a),rot(x,b); | |
| } | |
| upd(x); if(!t)rt=x; | |
| return x; | |
| } | |
| void rcc(int x){ | |
| if(!x)return; | |
| rcc(lx),rcc(rx); | |
| TStack[ts++]=x; | |
| } | |
| int select(int k, int t=0){ | |
| int x=rt; while (rls(x),sz[lx]!=k){ | |
| if (k<sz[lx]) x=lx; | |
| else k-=sz[lx]+1,x=rx; | |
| } | |
| return splay(x,t); | |
| } | |
| int select2(int a, int b){ | |
| return r[select(a-1, select(b+1))]; | |
| } | |
| void iod(int x){ | |
| if(!x)return; | |
| rls(x); iod(lx); | |
| printf(ky[x]==-INF?"$ " : "%d ", ky[x]); | |
| iod(rx); | |
| } | |
| #define mid (a+b>>1) | |
| #define lc a,mid-1 | |
| #define rc mid+1,b | |
| int A[N], s, n, m; inline int Build(int a = 1, int b = n){ | |
| if (a > b) return 0; | |
| int x = new_node(A[mid]); | |
| setl(x,Build(lc)),setr(x,Build(rc)),upd(x); | |
| return x; | |
| } | |
| int main(){ | |
| #ifndef ONLINE_JUDGE | |
| freopen("in.txt", "r", stdin); | |
| //freopen("out.txt", "w", stdout); | |
| #endif | |
| A[0] = -INF; | |
| Rush{ | |
| tp = ts = 0; RD(n, m); REP_1(i, n) RDD(A[i]); A[n+1] = -INF; rt = Build(0, n+1); | |
| int x, y, z; char cmd[10]; DO(m){ | |
| //iod(rt); puts(""); | |
| switch(RS(cmd)[0]){ | |
| case 'I': // Insert ... . | |
| RD(s, n);REP_1(i, n) RDD(A[i]);y=select(s,z=select(s+1)); | |
| setr(y,Build()),upd(y),upd(z); | |
| break; | |
| case 'D': // Delete | |
| RD(s, n);y=select(s-1,z=select(s+n)); | |
| rcc(r[y]),r[y]=0,upd(y),upd(z); | |
| break; | |
| case 'R': // Reverse .. | |
| RD(s, n);y=select(s-1,z=select(s+n)); | |
| rev(r[y]),upd(y),upd(z); | |
| break; | |
| case 'M': // Make_Same // Max_Sum | |
| if (cmd[2] == 'X') {OT(ms[rt]); break;} | |
| RD(s, n); y = select(s-1, z = select(s+n)); | |
| RDD(ky[r[y]]),sss(r[y]),upd(y),upd(z); | |
| break; | |
| default: // Get_Sum .. | |
| RD(s, n); | |
| y = select(s-1, z = select(s+n)); | |
| OT(ss[r[y]]); | |
| //OT(ss[select2(s, s+n-1)]); | |
| } | |
| } | |
| } | |
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Sep. 22th 2013 **/ //{ | |
| /** Header .. **/ //{ | |
| #pragma comment(linker, "/STACK:36777216") | |
| //#pragma GCC optimize ("O2") | |
| #define LOCAL | |
| //#include "testlib.h" | |
| #include <functional> | |
| #include <algorithm> | |
| #include <iostream> | |
| #include <fstream> | |
| #include <sstream> | |
| #include <iomanip> | |
| #include <numeric> | |
| #include <cstring> | |
| #include <climits> | |
| #include <cassert> | |
| #include <complex> | |
| #include <cstdio> | |
| #include <string> | |
| #include <vector> | |
| #include <bitset> | |
| #include <queue> | |
| #include <stack> | |
| #include <cmath> | |
| #include <ctime> | |
| #include <list> | |
| #include <set> | |
| #include <map> | |
| //#include <tr1/unordered_set> | |
| //#include <tr1/unordered_map> | |
| //#include <array> | |
| using namespace std; | |
| #define REP(i, n) for (int i=0;i<int(n);++i) | |
| #define FOR(i, a, b) for (int i=int(a);i<int(b);++i) | |
| #define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i) | |
| #define REP_1(i, n) for (int i=1;i<=int(n);++i) | |
| #define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i) | |
| #define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i) | |
| #define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i) | |
| #define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i) | |
| #define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i) | |
| #define REP_N(i, n) for (i=0;i<int(n);++i) | |
| #define FOR_N(i, a, b) for (i=int(a);i<int(b);++i) | |
| #define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i) | |
| #define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i) | |
| #define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i) | |
| #define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i) | |
| #define REP_1_N(i, n) for (i=1;i<=int(n);++i) | |
| #define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i) | |
| #define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i) | |
| #define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i) | |
| #define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i) | |
| #define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;--i) | |
| #define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i) | |
| #define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i) | |
| #define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;--i) | |
| #define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it) | |
| #define REP_S(i, str) for (char*i=str;*i;++i) | |
| #define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i]) | |
| #define REP_G(i, u) REP_L(i,hd[u],suc) | |
| #define REP_SS(x, s) for (int x=s;x;x=(x-1)&s) | |
| #define DO(n) for ( int ____n = n; ____n-->0; ) | |
| #define REP_2(i, j, n, m) REP(i, n) REP(j, m) | |
| #define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m) | |
| #define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l) | |
| #define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l) | |
| #define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn) | |
| #define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn) | |
| #define ALL(A) A.begin(), A.end() | |
| #define LLA(A) A.rbegin(), A.rend() | |
| #define CPY(A, B) memcpy(A, B, sizeof(A)) | |
| #define INS(A, P, B) A.insert(A.begin() + P, B) | |
| #define ERS(A, P) A.erase(A.begin() + P) | |
| #define BSC(A, x) (lower_bound(ALL(A), x) - A.begin()) | |
| #define CTN(T, x) (T.find(x) != T.end()) | |
| #define SZ(A) int((A).size()) | |
| #define PB push_back | |
| #define MP(A, B) make_pair(A, B) | |
| #define PTT pair<T, T> | |
| #define Ts *this | |
| #define rTs return Ts | |
| #define fi first | |
| #define se second | |
| #define re real() | |
| #define im imag() | |
| #define Rush for(int ____T=RD(); ____T--;) | |
| #define Display(A, n, m) { \ | |
| REP(i, n){ \ | |
| REP(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m-1] << endl; \ | |
| } \ | |
| } | |
| #define Display_1(A, n, m) { \ | |
| REP_1(i, n){ \ | |
| REP_1(j, m-1) cout << A[i][j] << " "; \ | |
| cout << A[i][m] << endl; \ | |
| } \ | |
| } | |
| typedef long long LL; | |
| //typedef long double DB; | |
| typedef double DB; | |
| typedef unsigned uint; | |
| typedef unsigned long long uLL; | |
| typedef vector<int> VI; | |
| typedef vector<char> VC; | |
| typedef vector<string> VS; | |
| typedef vector<LL> VL; | |
| typedef vector<DB> VF; | |
| typedef set<int> SI; | |
| typedef set<string> SS; | |
| typedef map<int, int> MII; | |
| typedef map<string, int> MSI; | |
| typedef pair<int, int> PII; | |
| typedef pair<LL, LL> PLL; | |
| typedef vector<PII> VII; | |
| typedef vector<VI> VVI; | |
| typedef vector<VII> VVII; | |
| template<class T> inline T& RD(T &); | |
| template<class T> inline void OT(const T &); | |
| //inline int RD(){int x; return RD(x);} | |
| inline LL RD(){LL x; return RD(x);} | |
| inline DB& RF(DB &); | |
| inline DB RF(){DB x; return RF(x);} | |
| inline char* RS(char *s); | |
| inline char& RC(char &c); | |
| inline char RC(); | |
| inline char& RC(char &c){scanf(" %c", &c); return c;} | |
| inline char RC(){char c; return RC(c);} | |
| //inline char& RC(char &c){c = getchar(); return c;} | |
| //inline char RC(){return getchar();} | |
| template<class T> inline T& RDD(T &); | |
| inline LL RDD(){LL x; return RDD(x);} | |
| template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;} | |
| template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;} | |
| template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;} | |
| template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);} | |
| template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);} | |
| template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);} | |
| inline char& RC(char &a, char &b){RC(a), RC(b); return a;} | |
| inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;} | |
| inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;} | |
| inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;} | |
| inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;} | |
| inline void RS(char *s1, char *s2){RS(s1), RS(s2);} | |
| inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);} | |
| template<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);} | |
| template<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);} | |
| template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));} | |
| template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));} | |
| template<class T> inline void CLR(T &A){A.clear();} | |
| template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);} | |
| template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);} | |
| template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);} | |
| template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);} | |
| template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);} | |
| template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();} | |
| template<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();} | |
| template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);} | |
| template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);} | |
| template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);} | |
| template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);} | |
| template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);} | |
| template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);} | |
| template<class T> inline bool EPT(T &a){return a.empty();} | |
| template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;} | |
| template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;} | |
| template<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;} | |
| template<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;} | |
| template<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);} | |
| //} | |
| /** Constant List .. **/ //{ | |
| const int MOD = int(1e9) + 7; | |
| //int MOD = 99990001; | |
| const int INF = 0x3f3f3f3f; | |
| const LL INFF = 0x3f3f3f3f3f3f3f3fLL; | |
| const DB EPS = 1e-9; | |
| const DB OO = 1e20; | |
| const DB PI = acos(-1.0); //M_PI; | |
| const int dx[] = {-1, 0, 1, 0}; | |
| const int dy[] = {0, 1, 0, -1}; | |
| //} | |
| /** Add On .. **/ //{ | |
| // <<= '0. Nichi Joo ., //{ | |
| template<class T> inline T& checkMin(T &a,const T b){if (b<a) a=b;return a;} | |
| template<class T> inline T& checkMax(T &a,const T b){if (a<b) a=b;return a;} | |
| template<class T> inline T& checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);return a;} | |
| template<class T> inline T& checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);return a;} | |
| template <class T, class C> inline T& checkMin(T& a, const T b, C c){if (c(b,a)) a = b;return a;} | |
| template <class T, class C> inline T& checkMax(T& a, const T b, C c){if (c(a,b)) a = b;return a;} | |
| template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);} | |
| template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);} | |
| template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));} | |
| template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));} | |
| template<class T> inline T sqr(T a){return a*a;} | |
| template<class T> inline T cub(T a){return a*a*a;} | |
| template<class T> inline T ceil(T x, T y){return (x - 1) / y + 1;} | |
| template<class T> T abs(T x){return x>0?x:-x;} | |
| inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;} | |
| inline int sgn(DB x, DB y){return sgn(x - y);} | |
| inline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))/(2*a*b);} | |
| inline DB cot(DB x){return 1./tan(x);}; | |
| inline DB sec(DB x){return 1./cos(x);}; | |
| inline DB csc(DB x){return 1./sin(x);}; | |
| //} | |
| // <<= '1. Bitwise Operation ., //{ | |
| namespace BO{ | |
| inline bool _1(int x, int i){return bool(x&1<<i);} | |
| inline bool _1(LL x, int i){return bool(x&1LL<<i);} | |
| inline LL _1(int i){return 1LL<<i;} | |
| inline LL _U(int i){return _1(i) - 1;}; | |
| inline int reverse_bits(int x){ | |
| x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa); | |
| x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc); | |
| x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0); | |
| x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00); | |
| x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000); | |
| return x; | |
| } | |
| inline LL reverse_bits(LL x){ | |
| x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL); | |
| x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL); | |
| x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL); | |
| x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL); | |
| x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL); | |
| x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL); | |
| return x; | |
| } | |
| template<class T> inline bool odd(T x){return x&1;} | |
| template<class T> inline bool even(T x){return !odd(x);} | |
| template<class T> inline T low_bit(T x) {return x & -x;} | |
| template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;} | |
| template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;} | |
| template<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;} | |
| inline int clz(int x){return __builtin_clz(x);} | |
| inline int clz(LL x){return __builtin_clzll(x);} | |
| inline int ctz(int x){return __builtin_ctz(x);} | |
| inline int ctz(LL x){return __builtin_ctzll(x);} | |
| inline int lg2(int x){return !x ? -1 : 31 - clz(x);} | |
| inline int lg2(LL x){return !x ? -1 : 63 - clz(x);} | |
| inline int low_idx(int x){return !x ? -1 : ctz(x);} | |
| inline int low_idx(LL x){return !x ? -1 : ctz(x);} | |
| inline int high_idx(int x){return lg2(x);} | |
| inline int high_idx(LL x){return lg2(x);} | |
| inline int parity(int x){return __builtin_parity(x);} | |
| inline int parity(LL x){return __builtin_parityll(x);} | |
| inline int count_bits(int x){return __builtin_popcount(x);} | |
| inline int count_bits(LL x){return __builtin_popcountll(x);} | |
| } using namespace BO;//} | |
| //} | |
| /** I/O Accelerator Interface .. **/ //{ | |
| #define g (c=getchar()) | |
| #define d isdigit(g) | |
| #define p x=x*10+c-'0' | |
| #define n x=x*10+'0'-c | |
| #define pp l/=10,p | |
| #define nn l/=10,n | |
| template<class T> inline T& RD(T &x){ | |
| char c;while(!d);x=c-'0';while(d)p; | |
| return x; | |
| } | |
| template<class T> inline T& RDD(T &x){ | |
| char c;while(g,c!='-'&&!isdigit(c)); | |
| if (c=='-'){x='0'-g;while(d)n;} | |
| else{x=c-'0';while(d)p;} | |
| return x; | |
| } | |
| inline DB& RF(DB &x){ | |
| //scanf("%lf", &x); | |
| char c;while(g,c!='-'&&c!='.'&&!isdigit(c)); | |
| if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;} | |
| else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}} | |
| else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;} | |
| else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}} | |
| return x; | |
| } | |
| #undef nn | |
| #undef pp | |
| #undef n | |
| #undef p | |
| #undef d | |
| #undef g | |
| inline char* RS(char *s){ | |
| //gets(s); | |
| scanf("%s", s); | |
| return s; | |
| } | |
| LL last_ans; int Case; template<class T> inline void OT(const T &x){ | |
| //printf("Case #%d: ", ++Case); | |
| //printf("%lld\n", x); | |
| //printf("%.4f\n", x); | |
| printf("%d\n", x); | |
| //cout << x << endl; | |
| //last_ans = x; | |
| } | |
| //} | |
| //}/* .................................................................................................................................. */ | |
| const int N = 500009; | |
| struct node{ | |
| static node *NIL, *rt, *tp; node *c[2], *p; | |
| int sz, ky, ss, ls, rs, ms, bj; | |
| #define NIL node::NIL | |
| #define rt node::rt | |
| #define l c[0] | |
| #define r c[1] | |
| #define lx x->l | |
| #define rx x->r | |
| #define px x->p | |
| #define ly y->l | |
| #define ry y->r | |
| #define py y->p | |
| inline void reset(int v){l=r=p=NIL,ky=v,bj=0;} | |
| inline void rev(){bj^=1,swap(l,r),swap(ls,rs);} | |
| inline void sss(){bj=2,ss=sz*ky,ms=ls=rs=ky<0?ky:ss;} | |
| inline void upd(){ | |
| assert(this != NIL); | |
| sz = l->sz + 1 + r->sz, ss = l->ss + ky + r->ss; | |
| ls = max(l->ls, l->ss + ky + max(0, r->ls)); | |
| rs = max(r->rs, r->ss + ky + max(0, l->rs)); | |
| ms = max(l->ms, max(0, l->rs) + ky + max(0, r->ls), r->ms); | |
| } | |
| inline void rls(){ | |
| assert(this != NIL); | |
| if (bj){ | |
| if (bj&1) l->rev(), r->rev(); | |
| if (bj&2) l->ky = r->ky = ky, l->sss(), r->sss(); | |
| bj = 0; | |
| } | |
| } | |
| inline int sgn(){return p->r==this;} | |
| inline void setc(int d,node*x){c[d]=x,px=this;} | |
| inline void setl(node*x){setc(0,x);} | |
| inline void setr(node*x){setc(1,x);} | |
| inline void rot(int d){ | |
| node*y=p,*z=py;z->setc(y->sgn(),this); | |
| y->setc(d,c[!d]),setc(!d,y),y->upd(); | |
| } | |
| inline void rot(){rot(sgn());} | |
| //inline void fix(){if (~sgn()) p->fix(); rls();} | |
| /* | |
| inline node* splay(node*t){ | |
| while (p!=t) rot(); upd(); | |
| return this; | |
| } | |
| */ | |
| inline node*splay(node*t){ | |
| int a,b;while(p!=t){ | |
| if (p->p==t){rot();break;} | |
| else a=sgn(),b=p->sgn(),(a^b?this:p)->rot(a),rot(b); | |
| } | |
| upd();if (t==NIL)rt=this; | |
| return this; | |
| } | |
| void rcc(); | |
| void inorder(){ | |
| if (this == NIL) return; | |
| rls(); l->inorder(); | |
| printf(ky == -INF ? "$ " : "%d ", ky); | |
| r->inorder(); | |
| } | |
| } *NIL, *rt, TPool[N], *TStack[N]; | |
| int tp, ts; | |
| #define mid (a + b >> 1) | |
| #define lc a, mid-1 | |
| #define rc mid+1, b | |
| node *select(int k, node*t=NIL){ | |
| node *x = rt; while (x->rls(), lx->sz != k){ | |
| if (k < lx->sz) x = lx; | |
| else k -= lx->sz+1, x = rx; | |
| } | |
| return x->splay(t); | |
| } | |
| node *select(int a, int b){ | |
| return select(a-1, select(b+1))->r; | |
| } | |
| inline void node::rcc(){ | |
| if (this == NIL) return; | |
| l->rcc(), r->rcc(); | |
| TStack[++ts] = this; | |
| } | |
| inline node *new_node(int v){ | |
| node *x = ts ? TStack[ts--] : &TPool[++tp]; | |
| x->reset(v); | |
| return x; | |
| } | |
| int A[N], s, n, m; inline node *Build(int a = 1, int b = n){ | |
| if (a > b) return NIL; | |
| node *x = new_node(A[mid]); | |
| x->setl(Build(lc)), x->setr(Build(rc)), x->upd(); | |
| return x; | |
| } | |
| int main(){ | |
| #ifndef ONLINE_JUDGE | |
| freopen("in.txt", "r", stdin); | |
| //freopen("out.txt", "w", stdout); | |
| #endif | |
| NIL = &TPool[0], A[0] = -INF; | |
| Rush{ | |
| tp = ts = 0; RD(n, m); REP_1(i, n) RDD(A[i]); A[n+1] = -INF; rt = Build(0, n+1); | |
| node *x, *y, *z; char cmd[10]; DO(m){ | |
| switch(RS(cmd)[0]){ | |
| case 'I': // Insert ... . | |
| RD(s, n); REP_1(i, n) RDD(A[i]); y = select(s, z = select(s+1)), x = Build(); | |
| y->setr(x), y->upd(), z->upd(); | |
| break; | |
| case 'D': // Delete | |
| RD(s, n); y = select(s-1, z = select(s+n)), x = ry; | |
| x->rcc(), ry = NIL, y->upd(), z->upd(); | |
| break; | |
| case 'R': // Reverse .. | |
| RD(s, n); y = select(s-1, z = select(s+n)), x = ry; | |
| x->rev(), y->upd(), z->upd(); | |
| break; | |
| case 'M': // Make_Same // Max_Sum | |
| if (cmd[2] == 'X') {OT(rt->ms); break;} | |
| RD(s, n); y = select(s-1, z = select(s+n)), x = ry; | |
| RDD(x->ky), x->sss(), y->upd(), z->upd(); | |
| break; | |
| default: // Get_Sum .. | |
| RD(s, n); | |
| OT(select(s, s+n-1)->ss); | |
| } | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment