[置顶] macro definition for cfs 、tc.

边集和树状数组

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <map>
#include <vector>
#include <string>
#include <algorithm>

const double pi=cos(-1.);
const double eps=1e-6;
const double eps1=1e-9;
const int inf=0x7fffffff;
///const int inf=0x3f3f3f3f;
const long long infl=1ll<<62;

///******macro defination******///
#define cas(a) int a; scanf("%d", &a); while (a--)
#define cas1(x, a) int a; scanf("%d", &a); for (int x=1; x<=a; ++x)
#define int(a) int a; scanf("%d", &a)
#define char(a) char a; scanf("%c", &a)
#define strr(a, x) char a[x]; scanf("%s", &a)
#define clean(a, x) memset (a, x, sizeof(a));
#define copy(a, b) memcpy(a, b, sizeof(a));
#define up(x,a) for(int x=0; x<a; ++x)
#define down(x,a) for(int x=a-1; x>=0; --x)
#define up1(x,a) for (int x=1; x<=a; ++x)

#define debug(a) printf("here is %d!!!\n", a);
///*** mathmatics ***///
#define sqr(x) (x)*(x)
#define abs(x) (x)>0?(x):(-(x))
#define zero(x) (x)<eps && (x)>eps
#define lowbit(x) ((x)&(-(x)))
///*** for STL ***///
#define fst first
#define scd second
#define pb push_back
#define mp makepair
#define lb lower_bound
#define ub upper_bound
///******   by Geners   ******///
typedef long long ll;
typedef unsigned int UI;

using namespace std;
const int mod=1000000007;
const int maxn=100000+123;

//#define vex edge[p].v
//int w[maxn];
//struct Edge{int v, w, next;}edge[2*maxn];
//int head[maxn], cnt;
//void addedge(int u, int v, int w=0){
//edge[cnt].v=v; edge[cnt].w=w; edge[cnt].next=head[u]; head[u]=cnt++;
//}
///*** graphic theory***///

//ll C[2*maxn];
//int N;
//int Query(int x){
//    for (int res=0; ; res+=C[x], x-=lowbit(x))if(x==0)return res;
//}
//void Update(int x, int v){
//    for (;x<=N; x+=lowbit(x))C[x]+=v;
//}
//void IUpdate(int s, int t, int v){
//    Update(t+1, -v); Update(s, v);
//}
//int FindS(int sum){/// found the greatest position of prefix
//    int idx=0;
//    for (int bitMask=1<<20; bitMask!=0 && idx<N; bitMask>>=1){/// bitMask is more than idx.
//        idx|=bitMask;
//        if(idx<N && sum>=C[idx])
//            sum-=C[idx];
//        else idx^=bitMask;
//    }
//    return sum?-1:idx;/// -1 means not found!
//}
///*** Binary Indexed Tree ***///

int main ()
{

    return 0;
}
/*


*/