Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 30268 | Accepted: 13202 |
Description
Input
Output
Sample Input
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
Hint
Source
代码:
1 #include<stdio.h> 2 #include<string.h> 3 #define maxn 32005 4 #define lowbit(x) ((x)&(-x)) 5 int aa[maxn]; 6 int bb[15005]; 7 void ope(int x) 8 { 9 while(x<maxn) 10 { 11 aa[x]++; 12 x+=lowbit(x); 13 } 14 } 15 int getsum(int x) 16 { 17 int ans=0; 18 while(x>0) 19 { 20 ans+=aa[x]; 21 x-=lowbit(x); 22 } 23 return ans; 24 } 25 int main() 26 { 27 int nn,i,a; 28 while(scanf("%d",&nn)!=EOF) 29 { 30 memset(aa,0,sizeof(aa)); 31 memset(bb,0,sizeof(int)*(nn)); 32 for(i=0;i<nn;i++) 33 { 34 scanf("%d%*d",&a); 35 a++; 36 bb[getsum(a)]++; 37 ope(a); 38 } 39 for(i=0;i<nn;i++) 40 printf("%d\n",bb[i]); 41 } 42 return 0; 43 }
poj------2352 Stars(树状数组),布布扣,bubuko.com
原文:http://www.cnblogs.com/gongxijun/p/3675227.html