看了这篇博客我才知道我好像不太懂C和Cpp

最新推荐文章于 2023-03-14 09:32:39 发布
最新推荐文章于 2023-03-14 09:32:39 发布
阅读量257 收藏
点赞数
分类专栏： 杂记

博客出处：http://blog.csdn.net/metalseed/article/details/8045038
以下贴出极其变态的头文件…

#include <algorithm>  
#include <iostream>  
#include <iomanip>  
#include <sstream>  
#include <cstring>  
#include <cstdio>  
#include <string>  
#include <vector>  
#include <bitset>  
#include <queue>  
#include <stack>  
#include <cmath>  
#include <ctime>  
#include <list>  
#include <set>  
#include <map>  

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 (n____=int(n),i=0;i<n____;++i)  
#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)  
#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)  
#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)  
#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)  
#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)  

#define ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)  
#define DO(n) while(n--)  
#define DO_C(n) int n____ = n; while(n____--)  
#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)  
#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)  
#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)  
#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)  
#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 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) find(ALL(A), X) // != A.end()  
#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 Rush int T____; RD(T____); DO(T____)  
#pragma comment(linker, "/STACK:36777216")  
//#pragma GCC optimize ("O2")  
#define Ruby system("ruby main.rb")  
#define Haskell system("runghc main.hs")  
#define Pascal system("fpc main.pas")  

typedef long long LL;  
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> VD;  
typedef set<int> SI;  
typedef set<string> SS;  
typedef set<LL> SL;  
typedef set<DB> SD;  
typedef map<int, int> MII;  
typedef map<string, int> MSI;  
typedef map<LL, int> MLI;  
typedef map<DB, int> MDI;  
typedef map<int, bool> MIB;  
typedef map<string, bool> MSB;  
typedef map<LL, bool> MLB;  
typedef map<DB, bool> MDB;  
typedef pair<int, int> PII;  
typedef pair<int, bool> PIB;  
typedef vector<PII> VII;  
typedef vector<VI> VVI;  
typedef vector<VII> VVII;  
typedef set<PII> SII;  
typedef map<PII, int> MPIII;  
typedef map<PII, bool> MPIIB;  

/** I/O Accelerator **/  

/* ... :" We are I/O Accelerator ... Use us at your own risk ;) ... " .. */  

template<class T> inline void RD(T &);  
template<class T> inline void OT(const T &);  

inline int RD(){ int x; RD(x); return x;}  
template<class T> inline T& _RD(T &x){ RD(x); return x;}  
inline void RC(char &c){scanf(" %c", &c);}  
inline void RS(char *s){scanf("%s", s);}  

template<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}  
template<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}  
template<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);}  
template<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);}  
template<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);}  
template<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);}  
template<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}  
template<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}  
template<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);}  
template<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);}  
template<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);}  
template<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);}  

template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}  
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 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(T &A){A.clear();}  
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 void FLC(T &A, int x){memset(A, x, sizeof(A));}  
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){FLC(A0), FLC(A1), FLC(A2);}  
template<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);}  
template<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);}  
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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}  
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){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}  

template<class T> inline void SRT(T &A){sort(ALL(A));}  
template<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}  

/** Add - On **/  

const int MOD = 1000000007;  
const int INF = 1000000000;  
const DB EPS = 1e-2;  
const DB OO = 1e15;  
const DB PI = 3.14159265358979323846264; //M_PI;  

// <<= ` 0. Daily Use .,  

template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}  
template<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}  
template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}  
template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}  
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(min(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;}  
int Ceil(int x, int y){return (x - 1) / y + 1;}  

// <<= ` 1. Bitwise Operation .,  
inline bool _1(int x, int i){return x & 1<<i;}  
inline bool _1(LL x, int i){return x & 1LL<<i;}  
inline LL _1(int i){return 1LL<<i;}  
//inline int _1(int i){return 1<<i;}  
inline LL _U(int i){return _1(i) - 1;};  
//inline int _U(int i){return _1(i) - 1;};  


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;  
}  

inline int count_bits(int x){  
    x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);  
    x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);  
    x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);  
    x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);  
    x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);  
    return x;  
}  

inline int count_bits(LL x){  
    x = (x & 0x5555555555555555LL) + ((x & 0xaaaaaaaaaaaaaaaaLL) >> 1);  
    x = (x & 0x3333333333333333LL) + ((x & 0xccccccccccccccccLL) >> 2);  
    x = (x & 0x0f0f0f0f0f0f0f0fLL) + ((x & 0xf0f0f0f0f0f0f0f0LL) >> 4);  
    x = (x & 0x00ff00ff00ff00ffLL) + ((x & 0xff00ff00ff00ff00LL) >> 8);  
    x = (x & 0x0000ffff0000ffffLL) + ((x & 0xffff0000ffff0000LL) >> 16);  
    x = (x & 0x00000000ffffffffLL) + ((x & 0xffffffff00000000LL) >> 32);  
    return x;  
}  

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;  
}  

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;  
}  

// <<= ` 2. Modular Arithmetic Basic .,  

inline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}  
inline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}  
inline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}  
inline int dff(int a, int b){a -= b; if (a < 0) a  += MOD; return a;}  
inline void MUL(int &a, int b){a = (LL)a * b % MOD;}  
inline int pdt(int a, int b){return (LL)a * b % MOD;}  

inline int pow(int a, int b){  
    int c = 1;  
    while (b) {  
        if (b&1) MUL(c, a);  
        MUL(a, a), b >>= 1;  
    }  
    return c;  
}  

template<class T>  
inline int pow(T a, int b){  
    T c(1);  
    while (b) {  
        if (b&1) MUL(c, a);  
        MUL(a, a), b >>= 1;  
    }  
    return c;  
}  

inline int _I(int b){  
    int a = MOD, x1 = 0, x2 = 1, q;  
    while (true){  
        q = a / b, a %= b;  
        if (!a) return (x2 + MOD) % MOD;  
        DEC(x1, pdt(q, x2));  

        q = b / a, b %= a;  
        if (!b) return (x1 + MOD) % MOD;  
        DEC(x2, pdt(q, x1));  
    }  
}  

inline void DIV(int &a, int b){MUL(a, _I(b));}  
inline int qtt(int a, int b){return pdt(a, _I(b));}  

inline int sum(int a, int b, int MOD){  
    a += b; if (a >= MOD) a -= MOD;  
    return a;  
}  

inline int phi(int n){  
    int res = n;  
    for (int i=2;sqr(i)<=n;++i) if (!(n%i)){  
        DEC(res, qtt(res, i));  
        do{n /= i;} while(!(n%i));  
    }  
    if (n != 1)  
        DEC(res, qtt(res, n));  
    return res;  
}  

// <<= '9. Comutational Geometry .,  

struct Po; struct Line; struct Seg;  

inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}  
inline int sgn(DB x, DB y){return sgn(x - y);}  

struct Po{  
    DB x, y;  
    Po(DB _x = 0, DB _y = 0):x(_x), y(_y){}  

    friend istream& operator >>(istream& in, Po &p){return in >> p.x >> p.y;}  
    friend ostream& operator <<(ostream& out, Po p){return out << "(" << p.x << ", " << p.y << ")";}  

    friend bool operator ==(Po, Po);  
    friend bool operator !=(Po, Po);  
    friend Po operator +(Po, Po);  
    friend Po operator -(Po, Po);  
    friend Po operator *(Po, DB);  
    friend Po operator /(Po, DB);  

    bool operator < (const Po &rhs) const{return sgn(x, rhs.x) < 0 || sgn(x, rhs.x) == 0 && sgn(y, rhs.y) < 0;}  
    Po operator-() const{return Po(-x, -y);}  
    Po& operator +=(Po rhs){x += rhs.x, y += rhs.y; return *this;}  
    Po& operator -=(Po rhs){x -= rhs.x, y -= rhs.y; return *this;}  
    Po& operator *=(DB k){x *= k, y *= k; return *this;}  
    Po& operator /=(DB k){x /= k, y /= k; return *this;}  

    DB length_sqr(){return sqr(x) + sqr(y);}  
    DB length(){return sqrt(length_sqr());}  

    DB atan(){  
        return atan2(y, x);  
    }  

    void input(){  
        scanf("%lf %lf", &x, &y);  
    }  
};  

bool operator ==(Po a, Po b){return sgn(a.x - b.x) == 0 && sgn(a.y - b.y) == 0;}  
bool operator !=(Po a, Po b){return sgn(a.x - b.x) != 0 || sgn(a.y - b.y) != 0;}  
Po operator +(Po a, Po b){return Po(a.x + b.x, a.y + b.y);}  
Po operator -(Po a, Po b){return Po(a.x - b.x, a.y - b.y);}  
Po operator *(Po a, DB k){return Po(a.x * k, a.y * k);}  
Po operator *(DB k, Po a){return a * k;}  
Po operator /(Po a, DB k){return Po(a.x / k, a.y / k);}  

struct Line{  
    Po a, b;  
    Line(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}  
    Line(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}  
    Line(Seg);  

    friend ostream& operator <<(ostream& out, Line p){return out << p.a << "-" << p.b;}  
};  

struct Seg{  
    Po a, b;  
    Seg(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}  
    Seg(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}  
    Seg(Line l);  

    friend ostream& operator <<(ostream& out, Seg p){return out << p.a << "-" << p.b;}  
    DB length(){return (b - a).length();}  
};  

Line::Line(Seg l):a(l.a), b(l.b){}  
Seg::Seg(Line l):a(l.a), b(l.b){}  

#define innerProduct dot  
#define scalarProduct dot  
#define dotProduct dot  
#define outerProduct det  
#define crossProduct det  

inline DB dot(DB x1, DB y1, DB x2, DB y2){return x1 * x2 + y1 * y2;}  
inline DB dot(Po a, Po b){return dot(a.x, a.y, b.x, b.y);}  
inline DB dot(Po p0, Po p1, Po p2){return dot(p1 - p0, p2 - p0);}  
inline DB dot(Line l1, Line l2){return dot(l1.b - l1.a, l2.b - l2.a);}  
inline DB det(DB x1, DB y1, DB x2, DB y2){return x1 * y2 - x2 * y1;}  
inline DB det(Po a, Po b){return det(a.x, a.y, b.x, b.y);}  
inline DB det(Po p0, Po p1, Po p2){return det(p1 - p0, p2 - p0);}  
inline DB det(Line l1, Line l2){return det(l1.b - l1.a, l2.b - l2.a);}  

template<class T1, class T2> inline DB dist(T1 x, T2 y){return sqrt(dist_sqr(x, y));}  

inline DB dist_sqr(Po a, Po b){return sqr(a.x - b.x) + sqr(a.y - b.y);}  
inline DB dist_sqr(Po p, Line l){Po v0 = l.b - l.a, v1 = p - l.a; return sqr(fabs(det(v0, v1))) / v0.length_sqr();}  
inline DB dist_sqr(Po p, Seg l){  
    Po v0 = l.b - l.a, v1 = p - l.a, v2 = p - l.b;  
    if (sgn(dot(v0, v1)) * sgn(dot(v0, v2)) <= 0) return dist_sqr(p, Line(l));  
    else return min(v1.length_sqr(), v2.length_sqr());  
}  

inline DB dist_sqr(Line l, Po p){return dist_sqr(p, l);}  
inline DB dist_sqr(Seg l, Po p){return dist_sqr(p, l);}  

inline DB dist_sqr(Line l1, Line l2){  
    if (sgn(det(l1, l2)) != 0) return 0;  
    return dist_sqr(l1.a, l2);  
}  
inline DB dist_sqr(Line l1, Seg l2){  
    Po v0 = l1.b - l1.a, v1 = l2.a - l1.a, v2 = l2.b - l1.a; DB c1 = det(v0, v1), c2 = det(v0, v2);  
    return sgn(c1) != sgn(c2) ? 0 : sqr(min(fabs(c1), fabs(c2))) / v0.length_sqr();  
}  

bool isIntersect(Seg l1, Seg l2){  

    //if (l1.a == l2.a || l1.a == l2.b || l1.b == l2.a || l1.b == l2.b) return true;  

    return  
        min(l1.a.x, l1.b.x) <= max(l2.a.x, l2.b.x) &&  
        min(l2.a.x, l2.b.x) <= max(l1.a.x, l1.b.x) &&  
        min(l1.a.y, l1.b.y) <= max(l2.a.y, l2.b.y) &&  
        min(l2.a.y, l2.b.y) <= max(l1.a.y, l1.b.y) &&  
    sgn( det(l1.a, l2.a, l2.b) ) * sgn( det(l1.b, l2.a, l2.b) ) <= 0 &&  
    sgn( det(l2.a, l1.a, l1.b) ) * sgn( det(l2.b, l1.a, l1.b) ) <= 0;  

}  

inline DB dist_sqr(Seg l1, Seg l2){  
    if (isIntersect(l1, l2)) return 0;  
    else return min(dist_sqr(l1.a, l2), dist_sqr(l1.b, l2), dist_sqr(l2.a, l1), dist_sqr(l2.b, l1));  
}  

inline bool isOnExtremePoint(const Po &p, const Seg &l){  
    return p == l.a || p == l.b;  
}  

inline bool isOnseg(const Po &p, const Seg &l){  

    //if (p == l.a || p == l.b) return false;  

    return sgn(det(p, l.a, l.b)) == 0 &&  
        sgn(l.a.x, p.x) * sgn(l.b.x, p.x) <= 0 && sgn(l.a.y, p.y) * sgn(l.b.y, p.y) <= 0;  
}  

inline Po intersect(const Line &l1, const Line &l2){  
    return l1.a + (l1.b - l1.a) * (det(l2.a, l1.a, l2.b) / det(l2, l1));  
}  

// perpendicular foot  
inline Po intersect(const Po & p, const Line &l){  
    return intersect(Line(p, p + Po(l.a.y - l.b.y, l.b.x - l.a.x)), l);  
}  

inline Po rotate(Po p, DB alpha, Po o = Po()){  
    p.x -= o.x, p.y -= o .y;  
    return Po(p.x * cos(alpha) - p.y * sin(alpha), p.y * cos(alpha) + p.x * sin(alpha)) + o;  
}  

// <<= ' A. Random Event ..  

inline int rand32(){return (bool(rand() & 1) << 30) | (rand() << 15) + rand();}  
inline int random32(int l, int r){return rand32() % (r - l + 1) + l;}  
inline int random(int l, int r){return rand() % (r - l + 1) + l;}  
int dice(){return rand() % 6;}  
bool coin(){return rand() % 2;}  

// <<= ' 0. I/O Accelerator interface .,  

template<class T> inline void RD(T &x){  
    //cin >> x;  
    scanf("%d", &x);  
    //char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';  
    //char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';  
}  

template<class T> inline void OT(const T &x){  
    printf("%d\n", x);  
}  

/* .................................................................................................................................. */  

const int N = 50009, M = 10009;  

const int NN = 2500009;  

int l[NN], r[NN], c[NN], total;  

PII A[N+M]; int B[N+M], Q[M][3];  
int S[N], C[N], Null;  
int n, m, An, Tn;  

#define lx l[x]  
#define rx r[x]  
#define ly l[y]  
#define ry r[y]  
#define cx c[x]  
#define cy c[y]  

#define mid ((ll+rr)>>1)  
#define lc lx, ll, mid  
#define rc rx, mid+1, rr  


void Build(int &x, int ll, int rr){  
    x = ++total; if (ll < rr) Build(lc), Build(rc);  
}  

int Insert(int y, int p, int d){  

    int x = ++total, root = x;  

    c[x] = c[y] + d; int ll = 0, rr = Tn;  

    while (ll < rr){  
        if (p <= mid){  
            lx = ++total, rx = ry;  
            x = lx, y = ly, rr = mid;  
        }  
        else {  
            lx = ly, rx = ++total;  
            x = rx, y = ry, ll = mid + 1;  
        }  
        c[x] = c[y] + d;  
    }  

    return root;  
}  


struct Pack{  
    VI L;  

    inline Pack(){}  
    inline Pack(int x){L.PB(x);}  

    inline void operator += (int x){  
        L.PB(x);  
    }  

    inline operator int() const{  
        int res = 0; REP(i, SZ(L)) res += c[l[L[i]]];  
        return res;  
    }  

    void lt(){  
        REP(i, SZ(L)) L[i] = l[L[i]];  
    }  
    void rt(){  
        REP(i, SZ(L)) L[i] = r[L[i]];  
    }  

};  



void Modify(int x, int p, int d){  
    while (x <= n) C[x] = Insert(C[x], p, d), x += low_bit(x);  
}  

Pack Query(int x){  
    Pack res; while (x) res += C[x], x ^= low_bit(x);  
    return res;  
}  

int Query(int ll, int rr, int k){  

    --ll; Pack a = Query(rr), b = Query(ll), c = S[rr], d = S[ll];  

    int t; ll = 0, rr = Tn;  

    while (ll < rr){  
        if ((t = a - b + c - d) >= k){  
            a.lt(), b.lt(), c.lt(), d.lt();  
            rr = mid;  
        }  
        else {  
            a.rt(), b.rt(), c.rt(), d.rt();  
            k -= t, ll = mid + 1;  
        }  
    }  

    return ll;  
}  


int main(){  

#ifndef ONLINE_JUDGE  
    freopen("in.txt", "r", stdin);  
    //freopen("out.txt", "w", stdout);  
#endif  

#define key first  
#define id second  

    RD(n, m); REP(i, n) A[i] = MP(RD(), i);  

    An = n; char cmd; REP(i, m){  
        RC(cmd); if(cmd == 'Q') RD(Q[i][0], Q[i][1], Q[i][2]);  
        else RD(Q[i][0]), Q[i][2] = 0, A[An++] = MP(RD(), An);  
    }  

    sort(A, A + An), B[A[0].id] = Tn = 0;  
    FOR(i, 1, An){  
        if(A[i].key != A[i-1].key) A[++Tn].key = A[i].key;  
        B[A[i].id] = Tn;  
    }  

    Build(Null, 0, Tn); REP_1(i, n) C[i] = Null;  

    S[0] = Null; REP(i, n){  
        S[i+1] = Insert(S[i], B[i], 1);  
    }  

    An = n;  

    REP(i, m) if (Q[i][2]){  
        OT(A[Query(Q[i][0], Q[i][1], Q[i][2])].key);  
    }else{  
        Modify(Q[i][0], B[Q[i][0]-1], -1);  
        Modify(Q[i][0], B[Q[i][0]-1] = B[An++], 1);  
    }  
}
Triose_Stream
关注
专栏目录
C++顺序表、链表的*插删查等*操作
Nemoxy的博客
09-09 239
顺序表 #include <iostream> #include <cstring> using std::cout; using std::endl; //定义顺序表模板类 template <typename Type> class Vector { private: int size, length; Type *data; public: Vector(int input_size) { size = input_size;
我是如何自学C语言的（一个菜鸟的学习路）
cbirdfly's Blog
02-07 25万+
--------------------------------------------------------------------------------------------------------------------------- 零基础扫盲课： 计算机科学速成课（扫盲课）:http://www.bilibili.com/video/av21376839?...
看完这篇还不明白Handler你砍我！
郭霖
09-10 585
/ 今日科技快讯 /昨日，谷歌正式发布了最新版本的移动操作系统Android 11，并将源代码推给了Android开放源代码项目(AOSP)。与之前的旗舰版本不同，Android...
Makefile教程（绝对经典，所有问题看这一篇足够了）
热门推荐
weixin_38391755的博客
05-20 90万+
该篇文章为转载，是对原作者系列文章的总汇加上标注。支持原创，请移步陈浩大神博客：http://blog.csdn.net/haoel/article/details/2886makefile很重要      什么是makefile？或许很多Winodws的程序员都不知道这个东西，因为那些Windows的IDE都为你做了这个工作，但我觉得要作一个好的和professional的程序员，makefil...
语法糖——这一篇全了解
csdn_yaohailong的博客
08-12 421
语法糖（Syntactic Sugar），也称糖衣语法，是由英国计算机学家 Peter.J.Landin 发明的一个术语，指在计算机语言中添加的某种语法，这种语法对语言的功能并没有影响，但是更方便程序员使用。简而言之，语法糖让程序更加简洁，有更高的可读性。 解语法糖 前面提到过，语法糖的存在主要是方便开发人员...
【C语言】指针内容全篇
joy.728的博客
07-06 2012
每个优秀的人都有一段沉默的时光，那段时光是付出了很多努力却得不到结果的日子，我们把它叫做扎根。
C++入门 谁都能看懂的类和对象
wutongguo的博客
03-14 484
我这篇博客几乎包括了类和对象的所有入门的东西。 如果大家能看完，那么恭喜大家入门了
Makefile教程(绝对经典,所有问题看这一篇足够了)
Lapland的博客
02-09 2410
支持原创，请移步陈浩大神博客： http://blog.csdn.net/haoel/article/details/2886 makefile很重要 什么是makefile？或许很多Winodws的程序员都不知道这个东西，因为那些Windows的IDE都为你做了这个工作，但我觉得要作一个好的和professional的程序员，makefile还是要懂。这就好像现在有这么多的HTML的编辑器，...
一篇文章看懂makefile编写规则
darmao的博客
07-17 2万+
该篇文章为转载，是对原作者系列文章的总汇加上标注。 支持原创，请移步陈浩大神博客：（最原始版本） http://blog.csdn.net/haoel/article/details/2886   我转自一个博主  基于原博客的整理版本： http://blog.csdn.net/ruglcc/article/details/7814546/   makefile很重要       ...
C++支持函数重载，而C语言却不支持，原来是这个原因！
X_Mrjw的博客
09-24 2483
为什么C++支持函数重载而C语言却不支持？1.函数重载的概念2.函数名修饰----造成差异的真正原因2.1函数的编译过程+链接2.2Linux下的函数名修饰规则2.3Windows下VS中的函数名修饰3.extern "C" 1.函数重载的概念 如果你接触过C++，那么一定使用过插入运算符"<<“和提取运算符”>>"。这俩个运算符是C和C++位运算符中的左移运算符和右移运算符，而C++又把它作为输入输出运算符。允许一个运算符可以用于不同场合，不同的场合就有不同的含义，这就叫做运算符的
Windows MinGW配置C、C++编译环境
sinat_28371057的博客
06-20 1695
写在前面的前面：这篇文章vscode和cpp插件版本有点老了，仅供大家参考，最新的和最详细的更新见我的另一篇文章：https://blog.csdn.net/bat67/article/details/76095813 写在前面： 由于这学期（或者说这一年）一直在忙别的，也没什么闲心看博客了，近期发现自己的这篇文章:整理：Visual Studio Code (vscode) 配置C、C++环境/编写运行C、C++（Windows）竟然有了好多访问，也有不少童鞋问各种问题，非常感谢大家的支持，本来是.
ESP8266开发之旅 进阶篇⑪ 深入了解 Esp8266 Https访问
单片机菜鸟哥的博客
02-11 4万+
目前为止，我们讲解的很多例子都是使用 ==HTTP== 请求 。 但是涉及到一些 ==重要的用户数据== 的时候，我们基本上都是使用 ==HTTPS== 请求。 这一节，我们将讲解ESP8266上的 HTTPS请求。
我的个人主页
XDFZ_ST_HYX的博客
07-21 3794
我的个人主页
被知乎大佬嘲讽后的一个月，我重新研究了一下内联函数
Jerish的博客
01-04 3658
这绝不仅仅是一篇讲内联意义的文章，参考我的学习过程，可能对你的知识整合有很大帮助 之前写了一篇总结c++面试的文章，被大佬纠出来很多关于内联的问题与错误。抱着不误导别人以及学习的态度，我在之后的一个月里抽时间重新研究了一下内联函数，确实学到了很多以前不了解的知识。学习么~就是一个不断打破之前认知并重构知识的过程，每个人都是从一个什么都不懂的菜鸟逐渐成长为一个大牛的。 在这篇文章里，我会由浅入深的分...
配置中心.zip
最新发布
09-24
配置中心
基于java的物流管理系统报告的开题报告.docx
09-24
基于java的物流管理系统报告的开题报告.docx
企业级SpringCould脚手架工程：Eureka、Ribbon、Hystrix、Zuul、Feign、分布式事务.zip
09-24
企业级SpringCould脚手架工程：Eureka、Ribbon、Hystrix、Zuul、Feign、分布式事务、分布式锁、
基于Java的微信小程序html2wxml转换接口设计源码
09-24
该项目是基于Java的微信小程序html2wxml转换接口设计源码，共包含50个文件，其中包括10个属性配置文件、9个XML配置文件、6个首选项文件、6个Java源文件、3个Shell脚本、2个项目配置文件、2个HTML模板文件、1个类路径配置文件、1个Git忽略配置文件和1个JS类型定义文件。该解决方案利用JFinal、Jsoup和FastJson技术，为微信小程序提供高效的富文本渲染能力。
SOURCES中要写入我所有的.c和.cpp文件吗
05-30
这个代码会自动查找src目录下所有的.c和.cpp文件，并将它们的文件名保存到SOURCES变量中。这种方法可以简化makefile的编写，但需要注意的是，如果你的源文件不在同一个目录下，或者需要排除某些文件，就需要手动列出...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值