Hdu 5775模拟冒泡[树状数组]

最新推荐文章于 2021-05-15 13:09:58 发布

xgogoforit

最新推荐文章于 2021-05-15 13:09:58 发布

阅读量245

点赞数

分类专栏：暑期集训 hduoj

本文链接：https://blog.csdn.net/xgogoforit/article/details/52122110

版权

暑期集训同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

hduoj

8 篇文章 0 订阅

订阅专栏

题目连接

http://acm.hust.edu.cn/vjudge/problem/435522

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.

题意

模拟冒泡排序的过程，问一个数在移动的过程中，最右端可以移动到哪，最左端可以移动到哪，并求出d=最右端-最左端。

题解

首先注意到，题目中的冒泡排序的第二层是从后往前的，那么可知，最左端的位置一定是开始的初始位置与最终位置的较小值。因为从后往前，被动情况下只能向右移动，除非轮到自己，可以主动向左移动，而可以被动移动多少次呢？由该数后面有几个比他小的数决定[因为比他小的数都是要移动到他前面去的]，所以树状数组倒着扫描，计算一个数后面有多少个比这个数小的数。

代码

#include<bits/stdc++.h>
using namespace std;

int a[100005];
int c[100005];
int n=100005;
int ans[100005];
int bits(int k)
{
    return k&-k;
}

int sum(int k)
{
    int ans=0;
    while(k>0)
    {
        ans+=c[k];
        k-=bits(k);
    }
    return ans;
}
int add(int k,int val)
{
    while(k<=n)
    {
        c[k]+=val;
        k+=bits(k);
    }
}

int main()
{
    int jj;
    scanf("%d",&jj);
    int k=0;

    while(jj--)
    {   memset(a,0,sizeof(a));
        memset(c,0,sizeof(c));
        memset(ans,0,sizeof(ans));
        k++;
        int z;
        scanf("%d",&z);
        for(int i=1;i<=z;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=z;i>=1;i--)
        {   int t=sum(a[i]);
            add(a[i],1);

            int rimost=i+t;
            int lemost=min(a[i],i);
            ans[a[i]]=rimost-lemost;
        }
        printf("Case #%d:",k);
        for(int i=1;i<=z;i++)
            printf(" %d",ans[i]);
        printf("\n");
    }
    return 0;
}