wuzhibin

摘要： /*This Code is Submitted by billforum for Problem 2676 at 2012-02-11 17:27:50*/#include <stdio.h> #include <iostream> using namespace std; const int N=5000;int root[N+5],rank[N+5];void init(){ for(int i=1;i<=N;i++) { root[i]=i; rank[i]=1; } ... 阅读全文

摘要： /*This Code is Submitted by billforum for Problem 1640 at 2012-02-10 20:37:39*/#include <iostream>#include <stdio.h>using namespace std;const int N=1030;int t[N][N],maxi,maxj;/*int lowbit(int k){ return k & (k ^(k - 1));}void update(int x, int y, int val){ for (int i = x; i <= max 阅读全文