HDU5775 Bubble Sort树状数组
来源:互联网 发布:淘宝服装女装 编辑:程序博客网 时间:2024/05/17 22:21
题目链接:HDU5775
Bubble Sort
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 653 Accepted Submission(s): 387
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++.
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.
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.
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
233 1 231 2 3
Sample Output
Case #1: 1 1 2Case #2: 0 0 0HintIn 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 3In second case, the array has already in increasing order. So the answer of every number is 0.
题目分析:不难发现,对于一个数i,其运动轨迹是先向右移再向左移,原数组i右面有几个比他小的就右移多少格,最左端由i原来的位置和最后的位置最小值决定。
所以最左端O(1)统计,最右端用树状数组优化,时间复杂度O(nlogn)。
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int s[100010],p[100010];int r[100011];int c[100010];int n,t;int lowbit(int x){ return x&(-x);}void update(int x,int num){ while(x<=n) { c[x]+=num; x+=lowbit(x); }}int getsum(int x){ int s=0; while(x>0) { s+=c[x]; x-=lowbit(x); } return s;}int main(){ cin>>t; for(int k=1;k<=t;k++) { scanf("%d",&n); memset(r,0,sizeof(r)); memset(c,0,sizeof(c)); for(int i=1;i<=n;i++) { scanf("%d",&s[i]); p[s[i]]=i; } for(int i=n;i>=1;i--) { r[s[i]]=getsum(s[i]); update(s[i],1); } printf("Case #%d:",k); for(int i=1;i<=n;i++) { printf("% d",p[i]+r[i]-min(p[i],i)); } printf("\n"); }}
0 0
- HDU5775 Bubble Sort树状数组
- 【HDU5775】【树状数组】Bubble Sort 题解
- hdu5775 Bubble Sort 树状数组维护逆序数
- hdu5775 Bubble Sort
- HDU5775 Bubble Sort
- HDU5775-Bubble Sort
- hdu5775树状数组
- hdu5775 树状数组
- HDU5775(树状数组)
- HDU5775-Bubble Sort(逆序对)
- hdu 5774 Bubble Sort(树状数组)
- HDU 5775 Bubble Sort 树状数组
- 树状数组-HDU-5775-Bubble Sort
- HDU-5775-Bubble Sort-树状数组
- HDU - 5775 Bubble Sort(树状数组)
- HDU 5775 Bubble Sort(树状数组)
- HDU 5775 Bubble Sort [树状数组]【数据结构】
- hdu5775(思维题&树状数组)
- nmap
- 猜数字游戏
- SpaceShooter打飞机教程笔记(三)
- windows下多线程学习笔记1
- 118. Pascal's Triangle
- HDU5775 Bubble Sort树状数组
- AppBarLayout控件 & CoordinatorLayout 控件 详解
- 创建一个数组, 实现函数init()初始化数组、 实现empty()清空数组、 实现reverse()函数完成数组元素的逆置。自己设计函数的参数,返回值。
- 点线表示及其计算
- 5位运动员参加了10米台跳水比赛,有人让他们预测比赛结果 A选手说:B第一,我第三。 B选手说:我第二,E第四。 C选手说:我第一,D第二。 D选手说:C最后,我第三。 E选手说:我第四,A第一。 比
- android框架揭秘之android中c++写的服务笔记
- cuda gpu查询缓慢
- 轻松搞定GitHub Pages
- 【leetcode】经典算法题-Counting Bits