Bubble Sort_树状数组

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.

【题意】求出每个数能到达的最右和最左的坐标之差

【思路】从最后往前跟新到数组中，并且同时求出有多少个数小于当前数，则他所能到的右坐标是当前位置加上右边小于他的数的个数

左坐标是他min（当前位置，a[i]）

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
using namespace std;
const int N=+;
int a[N],sum[N*],pos[N],res[N];
int n;
int lowbit(int p)
{
    return p&(-p);
}
void update(int p)
{
    while(p<=n)
    {
        sum[p]+=;
        p+=lowbit(p);
    }
}
int get_sum(int p)
{
    int res=;
    while(p>)
    {
        res+=sum[p];
        p-=lowbit(p);
    }
    return res;
}
int main()
{
    int t,cas=;
    scanf("%d",&t);
    while(t--)
    {
        memset(sum,,sizeof(sum));
        scanf("%d",&n);
        for(int i=; i<=n; i++)
        {
            scanf("%d",&a[i]);
            pos[a[i]]=i;
        }
        for(int i=n; i>; i--)
    //倒序，从当前位置右边找出有多少小于他的数，记录在res中，他的最大右坐标是res+pos
        {
            update(a[i]);
            res[a[i]]=get_sum(a[i]-);
        }

        printf("Case #%d: ", cas++);
        for(int i=; i<=n; i++)
        {
            int minx=min(i,pos[i]);
            if(i!=n) printf("%d ",abs(pos[i]+res[i]-minx));
            else printf("%d\n",abs(pos[i]+res[i]-minx));

        }
    }
    return ;
}