摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2063#include <stdio.h>int graph[510][510], isVisit[510], match[510], m, n;int find(int a){ int i; for(i = 1; i <= n; i++){ if(graph[a][i] && !isVisit[i]){ isVisit[i] = 1; if((match[i] == -1) || find(match[i])){ match[i] = a; return 1; } } } 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1754#include <stdio.h>int tree[1000000], left[1000000], right[1000000], ans;void build(int p, int l, int r){ tree[p] = 0; left[p] = l; right[p] = r; if(l != r){ build((p * 2), l, ((l + r) / 2)); build(((p * 2) + 1), (((l + r) / 2) + 1), r); } return;}v 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1166#include <stdio.h>int tree[300000], left[300000], right[300000], sum;void build(int p, int l, int r){ tree[p] = 0; left[p] = l; right[p] = r; if(l != r){ build((p * 2), l, ((l + r) / 2)); build(((p * 2) + 1), (((l + r) / 2) + 1), r); } return;}void 阅读全文

摘要： #include <stdio.h>#define MAX_N 1000int n, next[MAX_N], data[MAX_N];void init(){ int i; n = 0; for(i = 0; i < MAX_N; i++){ next[i] = 0; } return;}void insert(int insertData, int nextData){ int pos = 0; n++; data[n] = insertData; while(next[pos] && (data[next[pos]] != nextData)){ pos 阅读全文