\u7ed9\u5b9a\u4e00\u7ec4\u6570\u5217\uff0c\u4f60\u8981\u6c42\u56de\u7b54\u8be2\u95ee [l, r] \u533a\u95f4\u5185\u7684\u6700\u5927\u5b50\u5b66\u5217\u548c\u662f\u591a\u5c11\u3002
\n\u8fd9\u91cc\u7684\u6700\u5927\u5b50\u5e8f\u5217\u548c\u88ab\u91cd\u5b9a\u4e49\u4e3a\uff0c\u5bf9\u4e8e\u533a\u95f4\u5185\u91cd\u590d\u51fa\u73b0\u7684\u6570\u5b57\uff0c\u53ea\u4f1a\u7edf\u8ba1\u4e00\u6b21\uff0c\u53e6\u5916\uff0c\u5141\u8bb8\u4e0d\u9009\u3002<\/p>\n
<\/p>\n
Tags: GSS\u3001\u7ebf\u6bb5\u6811\u3001\u79bb\u7ebf\u3001Hash\u3001\u53cc\u6807\u8bb0\u3002<\/p>\n
fgd \u7684\u6570\u636e\u7ed3\u6784 S \u7ea7\u795e\u9898\u3002\u3002\u3002\u65e0\u8bba\u4ece\u5efa\u6a21\u8fd8\u662f\u4ece\u5b9e\u73b0\u4e0a\u90fd\u6709\u4e00\u5b9a\u96be\u5ea6.. .<\/p>\n
\u9996\u5148\uff0c\u4f60\u8981\u5bf9 GSS1 \u7684\u79bb\u7ebf\u7b97\u6cd5\u6709\u4e86\u89e3\uff0c\u65b9\u6cd5\u662f\u5bf9\u8be2\u95ee\u7684\u53f3\u7aef\u70b9\u8fdb\u884c\u6392\u5e8f\uff0c\u7136\u540e\u5411\u53f3\u626b\u63cf\uff0c
\n\u540c\u65f6\u5904\u7406\u4e00\u4e2a\u5355\u70b9\u4fee\u6539\uff0c\u533a\u95f4\u6210\u6bb5\u8be2\u95ee\u7684\u7ebf\u6bb5\u6811\u95ee\u9898\uff0c\u5bf9\u4e8e\u533a\u95f4\u6210\u6bb5\u8be2\u95ee\uff08\u5c31\u662f\u6c42\u6700\u5927\u5b50\u5e8f\u5217\u3002\u3002\uff09\uff0c\u7ebf\u6bb5\u6811\u662f\u6ca1\u6709\u529e\u6cd5\u505a\u7684\uff0c
\n\u4f46\u662f\u53ef\u4ee5\u7c7b\u6bd4\u6811\u72b6\u6570\u7ec4\u4e2d\u5904\u7406\u533a\u95f4\u4fee\u6539\uff0c\u5355\u70b9\u8be2\u95ee\u65f6\u7684\u7b56\u7565\uff0c\u5c06\u4e4b\u8f6c\u6362\u6210\u533a\u95f4\u4fee\u6539\uff0c\u533a\u95f4\u5355\u70b9\u6700\u503c\u3002<\/p>\n
\u90a3\u4e48\u5728 GSS2 \u4e2d\uff0c\u6211\u4eec\u5c31\u53ea\u80fd\u4f7f\u7528\u8fd9\u79cd\u65b9\u6cd5\u4e86\uff0c\u56e0\u4e3a\u53ef\u4ee5\u901a\u8fc7\u5f00\u4e00\u4e2a Hash \u8bb0\u5f55\u8fd9\u4e2a\u6570\u5b57\u4e0a\u6b21\u51fa\u73b0\u7684\u7684\u4f4d\u7f6e\uff0c\u6765\u5904\u7406\u6389\u91cd\u590d\u6570\u5b57\u53ea\u8bb0\u5f55\u4e00\u6b21\u7684\u95ee\u9898\u3002
\n\u6b64\u5916\uff0c\u9700\u8981\u67e5\u8be2\u533a\u95f4\u4e2d\u5386\u53f2\u5b58\u5728\u7684\u6700\u503c\uff0c\u540c\u65f6\u9700\u8981\u518d\u5f15\u5165\u4e00\u4e2a\u6807\u8bb0\u6765\u7ef4\u62a4\u5b83\u3002
\n\u90fd\u6e05\u695a\u4e4b\u540e\u7ea7\u53ef\u4ee5\u52a8\u7b14\u4e86\u3002\u3002\u3002\u3002\u6570\u636e\u7ed3\u6784\u90fd\u662f\u6c34\u9898\u3002\u3002\u3002<\/p>\n
\uff08\u5bf9\u4e8e\u81f3\u5c11\u9009\u4e00\u4e2a\u6570\u5b57\u7684\u95ee\u9898\uff08\u4f8b\u5982 GSS1\uff0c\u4f46\u662f\u6211\u7528\u79bb\u7ebf\u8d85\u65f6\u4e86\u6492\u3002\u3002\uff09\u3002\u3002
\n\u3002\u3002\u5c06\u4e0b\u6587\u4e2d\u7684\u7684 SS\u3001DD \u521d\u59cb\u5316\u6210 -INF \u548c DD \u6bcf\u6b21 Release \u6389\u4e4b\u540e\u4e5f\u8d4b\u503c\u6210 -INF \u5373\u53ef\u4e86\u3002\uff09<\/p>\n
\r\n\/** ` Micro Mezzo Macro Flation -- Overheated Economy ., **\/\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <sstream>\r\n#include <cstring>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<int(n);++i)\r\n#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)\r\n#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)\r\n#define REP_1(i, n) for (int i=1;i<=int(n);++i)\r\n#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)\r\n#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)\r\n#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<int(n);++i)\r\n#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)\r\n#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)\r\n#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=int(n);++i)\r\n#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)\r\n#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)\r\n#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)\r\n\r\n#define DO(n) while(n--)\r\n#define DO_C(n) int n____ = n; while(n____--)\r\n#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)\r\n#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)\r\n#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)\r\n#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)\r\n#define REP_2(i, j, n, m) REP(i, n) REP(j, m)\r\n#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define BSC(A, X) find(ALL(A), X) \/\/ != A.end()\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int(A.size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n\r\n#define Rush int T____; RD(T____); DO(T____)\r\n#pragma comment(linker, "\/STACK:36777216")\r\n#pragma GCC optimize ("O2")\r\n#define Ruby system("ruby main.rb")\r\n#define Haskell system("runghc main.hs")\r\n#define Pascal system("fpc main.pas")\r\n\r\ntypedef long long LL;\r\ntypedef double DB;\r\ntypedef unsigned UINT;\r\ntypedef unsigned long long ULL;\r\n\r\ntypedef vector<int> VI;\r\ntypedef vector<char> VC;\r\ntypedef vector<string> VS;\r\ntypedef vector<LL> VL;\r\ntypedef vector<DB> VD;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef set<LL> SL;\r\ntypedef set<DB> SD;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef map<LL, int> MLI;\r\ntypedef map<DB, int> MDI;\r\ntypedef map<int, bool> MIB;\r\ntypedef map<string, bool> MSB;\r\ntypedef map<LL, bool> MLB;\r\ntypedef map<DB, bool> MDB;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<int, bool> PIB;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\ntypedef set<PII> SII;\r\ntypedef map<PII, int> MPIII;\r\ntypedef map<PII, bool> MPIIB;\r\n\r\n\r\n\/** I\/O Accelerator **\/\r\n\r\n\/* ... :" We are I\/O Accelerator ... Use us at your own risk ;) ... " .. *\/\r\n\r\ntemplate<class T> inline void RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\r\ntemplate<class T> inline T& _RD(T &x){ RD(x); return x;}\r\ninline int RD(){ int x; RD(x); return x;}\r\ninline LL RD_LL(){ LL x; RD(x); return x;}\r\ninline DB RD_DB(){ DB x; RD(x); return x;}\r\n\r\ntemplate<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}\r\ntemplate<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void 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);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void 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);}\r\ntemplate<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\ntemplate<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<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);}\r\ntemplate<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}\r\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\r\ntemplate<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}\r\ntemplate<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2){FLC(A0), FLC(A1), FLC(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3){FLC(A0), FLC(A1), FLC(A2), FLC(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4);}\r\ntemplate<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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}\r\ntemplate<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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}\r\n\r\ntemplate<class T> inline void SRT(T &A){sort(ALL(A));}\r\ntemplate<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}\r\n\r\n\r\n\/** Add - On **\/\r\n\r\nconst int MOD = 1000000007;\r\nconst LL INF = 0x7fffffff;\r\nconst DB PI = acos(-1.0);\r\nconst DB EPS = 1e-6;\r\nconst DB OO = 1e15;\r\n\r\n\/\/ <<= ` 0. Daily Use .,\r\n\r\ntemplate<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}\r\ntemplate <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}\r\ntemplate <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\nint Ceil(int x, int y){return (x - 1) \/ y + 1;}\r\n\r\n\/\/ <<= ` 1. Bitwise Operation .,\r\n\r\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline int _1(int i){return 1<<i;}\r\ninline int _U(int i){return _1(i) - 1;};\r\n\r\ninline int count_bits(int x){\r\n x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);\r\n x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);\r\n x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);\r\n x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);\r\n x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);\r\n return x;\r\n}\r\n\r\ntemplate<class T> inline T low_bit(T x) {\r\n return x & -x;\r\n}\r\n\r\ntemplate<class T> inline T high_bit(T x) {\r\n T p = low_bit(x);\r\n while (p != x) x -= p, p = low_bit(x);\r\n return p;\r\n}\r\n\r\n\/\/ <<= ` 2. Modular Arithmetic Basic .,\r\n\r\ninline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}\r\ninline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}\r\ninline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}\r\ninline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}\r\ninline void MUL(int &a, int b){a = (LL)a * b % MOD;}\r\ninline int pdt(int a, int b){return (LL)a * b % MOD;}\r\n\r\n\r\n\/\/ <<= ' 0. I\/O Accelerator interface .,\r\n\r\ntemplate<class T> inline void RD(T &x){\r\n \/\/cin >> x;\r\n scanf("%d", &x);\r\n \/\/char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n \/\/char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n\r\n}\r\n\r\n\/\/int ____Case;\r\ntemplate<class T> inline void OT(const T &x){\r\n \/\/cout << x << endl;\r\n printf("%lld\\n", x);\r\n \/\/printf("%.2lf\\n", x);\r\n \/\/printf("Case %d: %d\\n", ++____Case, x);\r\n}\r\n\r\n\r\n#define For_each(it, A) for (SII::iterator it = A.begin(); it != A.end(); ++it)\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 100001;\r\n\r\nVI Q[N], ID[N];\r\n\/\/ \u8be2\u95ee..\r\n\r\nint A[N]; LL B[N]; int n, m, a, b; LL d;\r\n\/\/ A[] \u5b58\u521d\u59cb\u6570\u7ec4\uff0cB[] \u5b58\u7b54\u6848, a, b \u8868\u793a\u8be2\u95ee\u533a\u95f4\u3002\r\n\r\nLL K[4*N], D[4*N], KK[4*N], DD[4*N];\r\n\/\/ \u7ebf\u6bb5\u6811\uff0c\u5355\u70b9\u52a0\u51cf\uff0c\u533a\u95f4\u6210\u6bb5\u6700\u503c -> \u6210\u6bb5\u52a0\u51cf\uff0c\u533a\u95f4\u6700\u503c\r\n\/\/ \u5f53\u524d\u7684\u6700\u5927\u503c\uff0c\u5ef6\u8fdf\u6807\u8bb0\uff0c\u5386\u53f2\u6700\u5927\u503c\uff0c\u5386\u53f2\u5ef6\u8fdf\u6807\u8bb0\u3002\r\n\r\nint ____[N], Hash[N];\r\n\r\n#define root 1, 1, n\r\n#define lx (x << 1)\r\n#define rx (lx | 1)\r\n#define lc lx, l, m\r\n#define rc rx, m+1, r\r\n\r\n#define Update KK[x] = max(max(KK[lx], K[lx] + DD[lx]), max(KK[rx], K[rx] + DD[rx])), K[x] = max(K[lx] + D[lx], K[rx] + D[rx])\r\n#define Release checkMax(DD[lx], D[lx] + DD[x]), checkMax(DD[rx], D[rx] + DD[x]), D[lx] += D[x], D[rx] += D[x], DD[x] = -INF, D[x] = 0\r\n\r\nvoid Insert(int x, int l, int r){\r\n if (a <= l && r <= b){\r\n D[x] += d, checkMax(DD[x], D[x]);\r\n }\r\n else {\r\n int m = (l + r) >> 1; Release;\r\n if (a <= m) Insert(lc); if (m < b) Insert(rc); Update;\r\n }\r\n}\r\n\r\nLL Query(int x, int l, int r){\r\n if (a <= l && r <= b){\r\n return max(KK[x], K[x] + DD[x]);\r\n }\r\n else {\r\n int m = (l + r) >> 1; Release, Update;\r\n return max((a <= m ? Query(lc) : -INF), (m < b ? Query(rc) : -INF));\r\n }\r\n}\r\n\r\nint main(){\r\n\r\n \/\/freopen("in.txt", "r", stdin);\r\n\r\n REP_1_C(i, _RD(n)) RD(A[i]);\r\n\r\n REP_C(i, _RD(m)) RD(a, b), Q[b].PB(a), ID[b].PB(i);\r\n\r\n REP_1_N(b, n){\r\n\r\n a = Hash[A[b]] + 1, d = A[b], Insert(root), Hash[d] = b;\r\n\r\n REP(i, SZ(Q[b])){\r\n a = Q[b][i], B[ID[b][i]] = Query(root);\r\n }\r\n }\r\n\r\n REP(i, m) OT(B[i]);\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"Brief descrption : \u7ed9\u5b9a\u4e00\u7ec4\u6570\u5217\uff0c\u4f60\u8981\u6c42\u56de\u7b54\u8be2\u95ee [l, r] \u533a\u95f4\u5185\u7684\u6700\u5927\u5b50\u5b66\u5217\u548c\u662f\u591a\u5c11\u3002 \u8fd9\u91cc\u7684\u6700\u5927\u5b50\u5e8f\u5217\u548c\u88ab\u91cd\u5b9a\u4e49\u4e3a\uff0c\u5bf9\u4e8e\u533a\u95f4\u5185\u91cd\u590d\u51fa\u73b0\u7684\u6570\u5b57\uff0c\u53ea\u4f1a\u7edf\u8ba1\u4e00\u6b21\uff0c\u53e6\u5916\uff0c\u5141\u8bb8\u4e0d\u9009\u3002<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[21],"tags":[30],"class_list":["post-59","post","type-post","status-publish","format-standard","hentry","category-spoj","tag-30"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-X","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/59","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=59"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/59\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=59"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=59"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=59"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}