3277 City Horizon 解题报告

 线段树离散化的第二题，做起来困难重重，wa到快崩溃了。偷看了一下波哥的博客才把它做出来了。活生生的一个山寨。。。今天要把线段树的题目刷完~

//这次线段树用的是半开区间,跟以往有些不同 //错误主要集中于线段树的insert操作,另外在 //map用1为起始下标导致了2+的wa //ERRORS: 5 wa + 3 tle + 1 re #include<stdio.h> #include<iostream> #include<algorithm> using namespace std; #define NIL 1111111111 #define M 41000 #define MUL -1 struct TNode{ int left,right; int h; }; TNode b[10*M]; int point[3*M],sz; int find(int x) { int left(0),right(sz); int mid = (left + right) >> 1; while(x != point[mid]){ if(point[mid] > x) right = mid; else left = mid; mid = (left + right) >> 1; } return mid; } void Build(int s,int t,int step) { b[step].left = s; b[step].right = t; b[step].h = 0; if((s+1) == t) return; int mid = (s + t) >> 1; Build(s,mid,step*2); Build(mid,t,step*2+1); return; } void Insert(int s,int t,int step,int height) { if(b[step].left == s && b[step].right == t ){ b[step].h = height; return; } if(b[step].h != MUL){ b[step*2].h = b[step].h; b[step*2+1].h = b[step].h; b[step].h = MUL; } int mid = (b[step].left + b[step].right) >> 1; if(mid >= t) { Insert(s,t,step*2,height); return; } if(mid <= s) { Insert(s,t,step*2+1,height); return; } Insert(s,mid,step*2,height); Insert(mid,t,step*2+1,height); } long long res(0); void Count(int step) { if(b[step].h != MUL) res += ((long long)b[step].h) * (point[b[step].right] - point[b[step].left]); else { Count(step*2); Count(step*2+1); } return; } struct Map{ int l,r,h; bool operator()(Map a,Map b) { return a.h < b.h; } }; int main() { Map map[M]; int n; scanf("%d",&n); sz = 0; for(int i = 0; i < n; i++) { scanf("%d%d%d",&(map[i].l),&(map[i].r),&(map[i].h)); point[sz++] = map[i].l; point[sz++] = map[i].r; } sort(point,point+sz); int index(0); point[index++] = point[0]; for(int i = 1; i < sz; ++i) // 去除temp[]中重复的点 if(point[i] != point[i-1]) point[index++] = point[i]; sz = index; Build(0,sz-1,1); //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! //对buildings的高度进行排序能有效地减少线段树的操作时间 sort(map,map+n,Map()); for(int i = 0; i < n; i++) Insert(find(map[i].l),find(map[i].r),1,map[i].h); Count(1); cout << res << endl; return 0; } //suikay 3277 Accepted 4320K 329MS G++ 2270B