首页 > 代码库 > poj 2299 Ultra-QuickSort
poj 2299 Ultra-QuickSort
Ultra-QuickSort
| Time Limit: 7000MS | Memory Limit: 65536K | |
| Total Submissions: 56054 | Accepted: 20706 |
Description
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence Ultra-QuickSort produces the output
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.
Input
The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 -- the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.
Output
For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.
Sample Input
59105431230
Sample Output
60
Source
Waterloo local 2005.02.05
/*数据结构好神奇！！！树状数组：将每个下标用二进制表示末尾有k个连续0，那么这个坐标盛放的数值就是2^k个数的和，就是从这个数往前数2^k的和。这个题先把数据离散化，所谓离散化呐，我现在的理解就是数据处理一下，使得内存占用小一点，对数列优化一下。这个题的优化就是对数据先进行排序，知道大小关系之后就不需要管这些数据了，然后在树中找每个数前面有多少比他小的数然后求和。*/#include<iostream>#include<stdio.h>#include<string.h>#include<string>#include<algorithm>#define N 500010using namespace std;struct node { long long val; long long ip;}fr[N];bool comp(node a,node b){ return a.val<b.val;}long long n;long long c[N];//记录每个节点的和long long index[N];//记录每个节点的和的下标long long lowbit(long long x){ return x&(-x);}long long getx(long long x){ long long ans=0; while(x>=1) { ans+=c[x]; x-=lowbit(x); } return ans;}void update(long long x){ while(x<=n) { c[x]+=1; x+=lowbit(x); }}int main(){ //freopen("in.txt","r",stdin); while(scanf("%lld",&n)!=EOF&&n) { for(int i=1;i<=n;i++) { scanf("%lld",&fr[i].val); fr[i].ip=i; } sort(fr+1,fr+n+1,comp); for(int i=1;i<=n;i++) index[fr[i].ip]=i; for(int i=1;i<=n;i++) c[i]=0; long long cur=0; for(int i=1;i<=n;i++) { update(index[i]); //cout<<getx(index[i])<<" "; cur+=(i-getx(index[i])); } //cout<<endl; printf("%lld\n",cur); } return 0;}/* _ooOoo_ o8888888o 88" . "88 (| -_- |) O\ = /O ____/`---‘\____ .‘ \\| |// `. / \\||| : |||// / _||||| -:- |||||- | | \\\ - /// | | | \_| ‘‘\---/‘‘ | | \ .-\__ `-` ___/-. / ___`. .‘ /--.--\ `. . __ ."" ‘< `.___\_<|>_/___.‘ >‘"". | | : `- \`.;`\ _ /`;.`/ - ` : | | \ \ `-. \_ __\ /__ _/ .-` / /======`-.____`-.___\_____/___.-`____.-‘====== `=---=‘^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ I have a dream!A AC deram!! orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz orz*/
poj 2299 Ultra-QuickSort
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。