ACM各种模版

// 二分图#include <iostream>#include <vector>using namespace std; constint Max = 1000+10;int x;int link[Max];bool used[Max];vector<int>myvector[Max]; bool Can(int k){int i;int size = myvector[k].size(); for(i = 0 ; i < size ; i ++){int a = myvector[k][i];if(!used[a]){used[a] = true;if(link[a] == -1 || Can(link[a])){link[a] = k;return true;}}}return false;}void solve(){int i;int count = 0;for(i = 1 ; i <= x ; i ++){memset(used,0,sizeof(used)); if(Can(i))count ++;}cout<< count/2 <<endl;}int main(){int k , m , n;int i;int a;int b;while(cin>> k){if(k == 0)break;cin>> m >> n;x = n+m;for(i = 0 ; i <= x ; i ++){myvector[i].clear();}memset(link,-1,sizeof(link)); while(k --){cin>> a >> b;myvector[a].push_back(b+m); myvector[b+m].push_back(a);}solve();}return 0;}// 深搜#include <iostream>using namespace std;char a[24][24]; // 地板...int sum;voiddigui(int i , int j);int main(){int W;int H;int x;int y;int i;int j;// void digui(int i , int j);while (cin>> W >> H) // a[H][W]{if(W == 0 && H == 0)break;for(i = 1 ; i <= H ; i ++ ){for(j = 1 ; j <= W ; j ++){cin>> a[i][j];if(a[i][j] == '@') /*初始位置*/{x = i;y = j;}}}for(i = 0 ; i <= W+1 ; i ++){a[0][i] = '#';a[H+1][i] = '#';}for(i = 0 ; i <= H+1 ; i ++){a[i][0] = '#';a[i][W+1] = '#';}sum = 0;digui(x,y);cout<< sum <<endl;}return 0;}voiddigui(int i , int j) {++ sum;a[i][j] = '#';if(a[i][j-1] == '.') digui(i,j-1);if(a[i][j+1] == '.') digui(i,j+1);if(a[i-1][j] == '.') digui(i-1,j);if(a[i+1][j] == '.') digui(i+1,j);}// 广搜…#include <iostream>#include <queue>using namespace std;constint Max = 30;char map[Max][Max];intdir[4][2] = {-1,0,1,0,0,-1,0,1}; //方向向量上下左右struct Point{intx,y;};int main(){int W;int H;int sum;int i;int j;Point start;queue<struct Point>Q;while(cin>> W >> H) // map[H][W];{sum = 0;if(W == 0 && H == 0)break;for(i = 1 ; i <= H ; i ++){for(j = 1 ; j <= W ; j ++){cin>> map[i][j];if(map[i][j] == '@'){start.x = i;start.y = j;}}}Q.push(start);map[start.x][start.y] = '#';sum ++;for(i = 0 ; i <= H+1 ; i ++){map[i][0] = '#';map[i][W+1] = '#';}for(j = 0 ; j <= W+1 ; j ++){map[0][j] = '#';map[H+1][j] = '#';}while(!Q.empty()){Point New;Point Head;Head = Q.front(); Q.pop();for(i = 0 ; i < 4 ; i ++){New.x = Head.x + dir[i][0]; New.y = Head.y + dir[i][1];if(map[New.x][New.y] == '.'){sum ++;Q.push(New);map[New.x][New.y] = '#';}}}cout<< sum <<endl;}return 0;}// 拓扑排序#include <iostream> using namespace std; constint Max = 600;int used[Max];int map[Max][Max]; intind[Max];intn,m;int Find(){int i;for(i = 1 ; i <= n ; i ++){if(ind[i] == 0 && !used[i]){used[i] = 1;return i;}}return -1;}void cut(int k){int i;for(i = 1 ; i <= n ; i ++){while(map[k][i]){ind[i] --;map[k][i] --;}}}int main(){int i;// int j;while(cin>> n >> m){int a;int b;memset(used,0,sizeof(used)); memset(map,0,sizeof(map)); while(m --){cin>> a >> b;map[a][b] ++;ind[b] ++;}int k;for(i = 0 ; i < n ; i ++){k = Find();cut(k);if(i)cout<< ' ' << k;elsecout<< k;}cout<<endl;}return 0;}// 树状数组#include <iostream>#include <string>using namespace std;constint Max = 50000+10;int sum[Max];int a[Max];int n;intlowbit (int x) //取x的最低位1，比如4，则返回4，如5，则返回1 {return x & (-x) ;}void add(inti,int value) //将第i个元素增加value{//i的祖先都要增加valwhile(i<=n){sum[i] += value ;i += lowbit(i) ; //将i的最低位1补1，得到其祖先}}int Sum(int i) //求前i项和{int count = 0;//将前i项分段while(i>0){count += sum[i] ;i -= lowbit(i) ; //去掉i的最低位1}return count ;}int main(){int t;int i;intcnt;intx,y;cin>> t;for(cnt = 1 ; cnt<= t ; cnt ++){cout<< "Case " <<cnt<< ":" <<endl; memset(sum,0,sizeof(sum)); cin>> n ;for(i = 1 ; i <= n ; i ++){scanf("%d",&a[i]);add(i,a[i]);}stringstr;while(cin>>str , str != "End"){scanf("%d %d",&x,&y);if(str=="Query"){printf("%d\n",Sum(y)-Sum(x-1));}if(str=="Add"){add(x,y) ;}if(str=="Sub"){add(x,-y);}}}return 0;}//kruskal#include <iostream>#include <algorithm>using namespace std;constint Max = 100+10;intFa[Max];int n;int m;int sum;struct Edge{int start;int end;int value;}edge[Max*Max];boolcmp(struct Edge a,struct Edge b) {returna.value<b.value;}voidInit(){int i;for(i = 0 ; i < Max ; i ++){Fa[i] = i;}}intFind_set(int x){int save[Max];int i = 0;while(x != Fa[x]){save[i++] = x;x = Fa[x];}for(;i > 0 ; i --){Fa[save[i-1]] = x;}return x;}void Union(int x , int y){x = Find_set(x);y = Find_set(y);if(x != y)Fa[x] = y;}voidkruskal(){intcnt = 0;int i;for(i = 0 ; i < m &&cnt< n-1 ; i ++){int a = edge[i].start;int b = edge[i].end;if(Find_set(a) != Find_set(b)){sum += edge[i].value;Union(a,b);cnt ++;}}}int main(){int i;while(cin>> n){if(n == 0)break;Init();m = n*(n-1)/2;for(i = 0 ; i < m ; i ++){cin>> edge[i].start >> edge[i].end >> edge[i].value;}sort(edge,edge+m,cmp); sum = 0;kruskal();cout<< sum <<endl;}return 0;}。