POJ_2528 线段树+离散化

看了那么多代码和解说，什么也没有看懂，最后找到了这篇博文(http://www.cppblog.com/MiYu/archive/2010/10/15/129997.aspx)，茅塞顿开啊！

我的思路：先划分出可能出现的所有区间，不超过20000，然后对这些区间构造线段树，然后自底向上插入覆盖的区间

代码：63ms过

#include <iostream> #include <algorithm> using namespace std; const int MAX_N = 10000; int N; int A[MAX_N+5], B[MAX_N+5], E[2*MAX_N+5]; struct Node { int left; int right; bool covered; } tree[6*MAX_N], edge[2*MAX_N+5]; void createTree(int root, int l, int r) { tree[root].left = edge[l].left; tree[root].right = edge[r].right; tree[root].covered = false; if(l==r) return; int mid = l + r>>1; createTree(root<<1, l, mid); createTree(root<<1 | 1, mid+1, r); } bool cmp(int a, int b) { return a < b; } bool insert(int root, int l, int r) { bool flag1 = false; bool flag2 = false; if(tree[root].covered) return false; if(tree[root].left==l && tree[root].right==r) { tree[root].covered = true; return true; } int child = root<<1; int mid = tree[child].right; if(r <= mid) flag1 = insert(child, l, r); else if(l > mid) flag2 = insert(child+1, l, r); else { if(l <= mid) flag1 = insert(child, l, mid); if(r > mid) flag2 = insert(child+1, mid+1, r); } tree[root].covered = tree[child].covered && tree[child+1].covered;//注意此处更新区间覆盖状态 return flag1 || flag2; } int main() { int T, i, ans; scanf("%d", &T); while(T--) { ans = 0; scanf("%d", &N); int j = 1; for(i=1; i<=N; i++) { scanf("%d%d", A+i, B+i); E[j++] = A[i]-1; E[j++] = B[i]; } int NN = N<<1; sort(E+1, E+1+NN, cmp); j = 1; //找到所有可能的区间（离散化） for(i=2; i<=NN; i++) { if(E[i]>E[i-1]) { edge[j].left = E[i-1] + 1; edge[j].right = E[i]; j++; } } //对找到可能存在的区间建立线段树 createTree(1, 1, j-1); for(i=N; i>=1; i--) { if(insert(1, A[i], B[i])) ans++; } printf("%d/n", ans); } return 0; }