hdoj5775Bubble Sort【树状数组】

Bubble Sort

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 543    Accepted Submission(s): 331

Problem Description

P is a permutation of the integers from 1 to N(index starting from 1).
Here is the code of Bubble Sort in C++.

for(int i=1;i<=N;++i)
    for(int j=N,t;j>i;—j)
        if(P[j-1] > P[j])
            t=P[j],P[j]=P[j-1],P[j-1]=t;

After the sort, the array is in increasing order. ?? wants to know the absolute values of difference of rightmost place and leftmost place for every number it reached.

 

Input

The first line of the input gives the number of test cases T; T test cases follow.
Each consists of one line with one integer N, followed by another line with a permutation of the integers from 1 to N, inclusive.

limits
T <= 20
1 <= N <= 100000
N is larger than 10000 in only one case. 

 

Output

For each test case output “Case #x: y1 y2 … yN” (without quotes), where x is the test case number (starting from 1), and yi is the difference of rightmost place and leftmost place of number i.

 

Sample Input

  
  

   
   2
3
3 1 2
3
1 2 3
  
  

 

Sample Output

  
  

   
   Case #1: 1 1 2
Case #2: 0 0 0


   
   

    
    

     
     Hint
    
    
In first case, (3, 1, 2) -> (3, 1, 2) -> (1, 3, 2) -> (1, 2, 3)
the leftmost place and rightmost place of 1 is 1 and 2, 2 is 2 and 3, 3 is 1 and 3
In second case, the array has already in increasing order. So the answer of every number is 0.

   
   
   
    
  
  

 

Author

FZU

 

Source

2016 Multi-University Training Contest 4

 

考虑一个位置上的数字c在冒泡排序过程的变化情况。c会被其后面比c小的数字各交换一次，之后c就会只向前移动。数组从右向左扫，树状数组维护一下得到每个值右边有多少个比其小的值，加上原位置得到最右位置，最左位置为初始位置和最终位置的最小值。

/* ***********************************************
Author       : ryc
Created Time : 2016-07-29 Friday
File Name    : E:\acmcode\hdoj\5775.cpp
LANGUAGE     : c++
Copyright 2016 ryc All Rights Reserved
************************************************ */
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
#include<stack>
using namespace std;
const int maxn=1e5+10;
int c[maxn],n,num[maxn];
int low(int n){
    return n&(-n);
}
void add(int p,int q){
    while(p<=maxn){
        c[p]+=q;
        p+=low(p);
    }
}
int sum(int n){
    int value=0;
    while(n>0){
        value+=c[n];
        n-=low(n);
    }
    return value;
}
int pos[maxn],ans[maxn];
int main()
{
    int t,test=1;cin>>t;
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<=n;++i){
            scanf("%d",&num[i]);
        }memset(c,0,sizeof(c));
        for(int i=n;i>=1;--i){
            pos[i]=sum(num[i]);
            add(num[i],1);
        }
        printf("Case #%d: ",test++);
        for(int i=1;i<=n;++i){
            ans[num[i]]=abs(i+pos[i]-min(num[i],i));
        }
        for(int i=1;i<=n;++i){
            if(i==n)
                printf("%d\n",ans[i]);
            else
                printf("%d ",ans[i]);
        }
    }
    return 0;
}