求逆序对数目
来源:互联网 发布:淘宝运营培训视频 编辑:程序博客网 时间:2024/06/05 15:43
求逆序对数目;注意:本问题算法的时间复杂度要求为O(nlogn)
Background Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Charlie would love to be able to do cool things like that, too. He wants to beat his brother in a similar task.
Problem Here’s what Charlie thinks of. Imagine you get a sequence of N numbers. The goal is to move the numbers around so that at the end the sequence is ordered. The only operation allowed is to swap two adjacent numbers. Let us try an example: Start with: 2 8 0 3 swap (2 8) 8 2 0 3 swap (2 0) 8 0 2 3 swap (2 3) 8 0 3 2 swap (8 0) 0 8 3 2 swap (8 3) 0 3 8 2 swap (8 2) 0 3 2 8 swap (3 2) 0 2 3 8 swap (3 8) 0 2 8 3 swap (8 3) 0 2 3 8
So the sequence (2 8 0 3) can be sorted with nine swaps of adjacent numbers. However, it is even possible to sort it with three such swaps: Start with: 2 8 0 3 swap (8 0) 2 0 8 3 swap (2 0) 0 2 8 3 swap (8 3) 0 2 3 8
The question is: What is the minimum number of swaps of adjacent numbers to sort a given sequence?Since Charlie does not have Raymond’s mental capabilities, he decides to cheat. Here is where you come into play. He asks you to write a computer program for him that answers the question in O(nlogn). Rest assured he will pay a very good prize for it.
输入格式:
The first line contains the length N (1 <= N <= 1000) of the sequence; The second line contains the N elements of the sequence (each element is an integer in [-1000000, 1000000]). All numbers in this line are separated by single blanks.
输出格式:
Print a single line containing the minimal number of swaps of adjacent numbers that are necessary to sort the given sequence.
输入样例:
在这里给出一组输入。例如:
6
-42 23 6 28 -100 65537
输出样例:
在这里给出相应的输出。例如:
5
#include<iostream>using namespace std;int n, a[10010], temp[10010], num;void Merge(int a[], int b[], int l, int m, int r) { int i = l, j = m + 1, k = l; while ((i<=m) && (j<=r)) if (a[i] <= a[j]) b[k++] = a[i++]; else { b[k++] = a[j++]; num += m - i + 1; } if (i>m) for (int q = j; q <= r; q++) b[k++] = a[q]; else for (int q = i; q <= m; q++) b[k++] = a[q]; for (int p = l; p <= r; p++) a[p] = temp[p];}void MergeSort(int a[], int left, int right) { if (left >= right) { return; } else { int i = (left + right) / 2; MergeSort(a, left, i); MergeSort(a, i+1, right); Merge(a, temp, left, i, right); }}int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; num = 0; MergeSort(a, 0, n - 1); cout << num << endl; system("pause");}
- 求逆序对数目
- 分治法求逆序对数目
- 归并排序求逆序对数目
- 【线段树+离散化】求逆序对数目
- 求数组中的逆序对数目(POJ1007)
- 每日一题26:求逆序对数目与求和
- 求一个序列中逆序对的数目
- 关于算法导论上一道题的思考,求逆序对数目
- HDU 1394 Minimum Inversion Number(线段树求逆序对数目)
- 归并排序计算逆序对数目
- 求逆序对
- 求逆序对
- 求逆序对
- wikioi1688 求逆序对
- POJ2299 求逆序对
- 归并求逆序对
- 求逆序对
- 求逆序对
- Python的安装
- 【20170924】Java每日一练
- composer问题之wnmp安装laravel报错
- IDEA教程
- AVRWARE++开发笔记11:将数组存于ROM中
- 求逆序对数目
- mapreduce作业接受序列化文件(SequenceFile)作为文件输入的WordCount程序
- [python] numpy axis概念整理筆記
- golang中os/exec包用法
- maven项目实战
- 使用JavaScript实现创建动态下拉菜单
- [JAVA]toString()、String.valueOf()、(String)
- 二次作业1
- 《Python数据分析常用手册》一、NumPy和Pandas篇