多校训练-Bubble Sort(树状数组+离散化)
来源:互联网 发布:数据化分析 编辑:程序博客网 时间:2024/05/28 01:36
Bubble Sort
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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.
#include <iostream> #include <string.h> #include <algorithm> #include <stdio.h> #include<math.h>using namespace std; const int N = 500005; struct Node { int v,order,x; }; int n; int c[N]; int aa[N]; //离散化后的数组 Node a[N],t[N]; //树状数组 int Lowbit(int x) { return x & (-x); } void Update(int t,int val) { for(int i=t; i<=n; i+=Lowbit(i)) c[i] += val; } int getSum(int x) { int ans=0; for(int i=x; i>0; i-=Lowbit(i)) ans += c[i]; return ans; } bool cmp(Node a,Node b) { return a.v<b.v; } int main() { int T,cases=0; scanf("%d",&T); while(T--) { scanf("%d",&n); //离散化 for(int i=1; i<=n; i++) { scanf("%d",&a[i].v); a[i].order=i; t[i]=a[i]; } sort(a+1,a+1+n,cmp); for(int i=1; i<=n; i++) aa[a[i].order]=i; //树状数组求逆序数 memset(c,0,sizeof(c)); int ans=0; for(int i=1; i<=n; i++) { Update(aa[i],1); ans=i-getSum(aa[i]); t[i].x=ans; } sort(t+1,t+n+1,cmp); printf("Case #%d: ",++cases); for(int i=1;i<n;i++) { if(t[i].order>i) printf("%d ",abs(t[i].x)); else printf("%d ",abs(i-(t[i].order-t[i].x)));}if(t[n].order>(n)) printf("%d\n",abs(t[n].x)); else printf("%d\n",abs(n-(t[n].order-t[n].x))); } return 0; }
0 0
- 多校训练-Bubble Sort(树状数组+离散化)
- (HDU 5775)Bubble Sort <树状数组> 多校训练4
- 2016多校训练Contest4: 1012 Bubble Sort hdu5775
- (树状数组)多校训练7 Segment Game
- hdu 5774 Bubble Sort(树状数组)
- HDU - 5775 Bubble Sort(树状数组)
- HDU 5775 Bubble Sort(树状数组)
- HDU5775 Bubble Sort树状数组
- 【多校训练】hdu 6035 Colorful Tree 树状数组
- zzuli oj 多校训练(三)【树链剖分--树状数组---STL----二分图----二分----DP】
- (HDU 5792)World is Exploding <树状数组+去重> 多校训练5
- 北方大学 ACM多校训练 第六场-1007-wmq的队伍(树状数组+dp)
- hdu5755 Bubble Sort(树状数组or线段树)
- HDU 5775 Bubble Sort (树状数组或线段树)
- hdu 5775 Bubble Sort 树状数组(多校)
- (多校第四场1012)HDU5763 Bubble Sort (树状数组)
- HDU 5775 Bubble Sort 树状数组
- 树状数组-HDU-5775-Bubble Sort
- 你不太了解的观止云分发之二:源站集群
- RMQ感想
- 数据流重定向小总结
- javaweb学习总结(二十三)——jsp自定义标签开发入门
- Arithmetic 正整数的四则运算
- 多校训练-Bubble Sort(树状数组+离散化)
- 关于tableview 编辑下多选择处理
- HDU 3038 How Many Answers Are Wrong
- mac brew 安装使用
- 【指导】SonarQube 部署说明
- HDU 1025 Constructing Roads In JGShining's Kingdom
- web 开发一个能进行人员管理(查询,删除,添加)的应用
- //切割字符串
- vector的push_back