PKU2352 stars

 

        这道题以前用treap写过，今天试了试树状数组，发现真是短时高效。上面的是以前的平衡树，下面是今天的树状数组。时间效率基本是两倍不说，编程复杂度那也是不言而喻的。当然了，这多亏了坐标都是整数。貌似这道题用线段树和归并排序也能解决一下，但我相信效率应该不是像树状数组这么理想吧！

program stars; const nn=33000; var c,ans:array[0..nn] of longint; n,i,x,y:longint; function lowbit(x:longint):longint; begin exit(x and (-x)); end; procedure add(x:longint); begin while x<=nn do begin inc(c[x]); inc(x,lowbit(x)); end; end; function sum(x:longint):longint; var ans:longint; begin ans:=0; while x>0 do begin inc(ans,c[x]); dec(x,lowbit(x)); end; exit(ans); end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); readln(n); fillchar(c,sizeof(c),0); fillchar(ans,sizeof(ans),0); for i:=1 to n do begin readln(x,y); inc(x); add(x); inc(ans[sum(x)-1]); end; for i:=0 to n-1 do writeln(ans[i]); close(input); close(output); end.