POJ2299归并排序
来源:互联网 发布:淘喵淘宝互刷流量软件 编辑:程序博客网 时间:2024/05/29 19:12
C - Ultra-QuickSort(7.2.2)(7.2应用排序算法编程的实验范例)
Crawling in process...Crawling failedTime Limit:7000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit
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
9 1 0 5 4 ,
Ultra-QuickSort produces the output
0 1 4 5 9 .
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given 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
#include <cstdio>#include <cstring>#include <iostream>#define lolo long longconst lolo maxn=510000;using namespace std;lolo ans;int a[maxn],t[maxn],n;void _sort(int l,int r)//归并排序{ if(l==r)return; int mid=(l+r)/2; _sort(l,mid); _sort(mid+1,r); int i=l,j=mid+1,now=0; while(i<=mid&&j<=r) { if(a[i]>a[j]) { ans+=mid-i+1; t[++now]=a[j++]; } else { t[++now]=a[i++]; } } while (i<=mid)t[++now]=a[i++]; while (j<=r)t[++now]=a[j++]; now=0; for(int k=l; k<=r; k++)a[k]=t[++now];}int main(){ scanf("%d",&n); while(n) { for(int i=1; i<=n; ++i)scanf("%d",&a[i]); ans=0; _sort(1,n); cout<<ans<<'\12'; scanf("%d",&n); } return 0;}
学习总结:归并排序
0 0
- 归并排序poj2299
- POJ2299(归并排序)
- POJ2299-归并排序
- POJ2299归并排序
- POJ2299(归并排序)
- poj2299&&归并排序
- POJ2299--归并排序--Ultra-QuickSort
- 1poj2299(串,归并排序)
- Ultra-QuickSort poj2299归并排序
- poj2299 归并排序求逆序对
- POJ2299 Ultra-QuickSort(归并排序)
- POJ2299 归并排序求逆序数
- 归并排序应用——poj2299
- poj2299 归并排序求逆序数
- poj2299 归并排序求逆序数
- poj2299--归并排序求逆序数
- poj2299~第一次明白了归并排序
- POJ2299(归并排序求逆序对)
- Spring之Aop与Ioc
- 0006.Map、Tuple、zip实战
- iphone开发之UIButton按钮的使用(一)拖线实现 多个按钮分别用多个方法实现事件监听
- 大整数乘法运算代码
- storm简介
- POJ2299归并排序
- ListView判断是否滚动,保存listview位置状态
- java综合(二)springmvc与spring整合
- Android中Input型输入设备驱动原理分析<一>
- 深入ListView
- Java String浅析
- HDU-1231 最大连续子序列
- 阿里巴巴2016研发工程师笔试题
- 老王赛马