UvaLive-5902-Movie collection
2013-04-21 21:26
246 查看
继续树状数组~
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> using namespace std; const int maxn=200100; int n,m,t[maxn*2],p[maxn*2]; int lowbit(int x) { return x&(-x); } int sum(int x) { int sum=0; while(x>0) { sum+=t[x]; x-=lowbit(x); } return sum; } void Update(int x,int val) { while(x<maxn) { t[x]+=val; x+=lowbit(x); } } int main() { int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); memset(t,0,sizeof(t)); for(int i=1;i<=n;i++) { Update(i,1); p[i]=n-i+1; } int pos=n; for(int i=1;i<=m;i++) { int ita; scanf("%d",&ita); int ans=sum(maxn-1)-sum(p[ita]); printf("%d%c",ans,i==m?'\n':' '); Update(p[ita],-1); p[ita]=++pos; Update(p[ita],1); } } return 0; }
相关文章推荐
- UVALive 5902 Movie collection
- UVALive 5902 Movie collection
- UVALive - 5902 Movie collection
- UVALive - 5902 Movie collection 二叉索引树
- uvalive 5902(BIT)
- UVALive 5902 Movie collection(树状数组)
- UVALive 5902 Movie collection
- UVa 1513 / UVALive 5902 Movie collection (树状数组)
- UVa 1513 / UVALive 5902 Movie collection (树状数组)
- UVALive 4881
- UVALive 5990 Array Diversit
- UVALive 4997 ABCD Tiles --DFS
- UVA12068 UVALive3288 Harmonic Mean【分数】
- uva live 3882 And Then There Was One 约瑟夫环
- CERC 2009 Cav 扫描法 (uvaLive 4621 - Cav)
- Uvalive6885(最短路)
- UVaLive 6694 Toy Boxes (二分+想法)
- uvalive 6800 - The Mountain of Gold? 判负环
- UVALive 3983 Robotruck (单调队列,dp)
- UVALive 4643 Twenty Questions