Brainman
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 9113 | Accepted: 4885 |
Description
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. Rest assured he will pay a very good prize for it.
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:
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:
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. Rest assured he will pay a very good prize for it.
Input
The first line contains the number of scenarios.
For every scenario, you are given a line containing first the length N (1 <= N <= 1000) of the sequence,followed by the N elements of the sequence (each element is an integer in [-1000000, 1000000]). All numbers in this line are separated by single blanks.
For every scenario, you are given a line containing first the length N (1 <= N <= 1000) of the sequence,followed by the N elements of the sequence (each element is an integer in [-1000000, 1000000]). All numbers in this line are separated by single blanks.
Output
Start the output for every scenario with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the minimal number of swaps of adjacent numbers that are necessary to sort the given sequence. Terminate the output for the scenario with a blank line.
Sample Input
4 4 2 8 0 3 10 0 1 2 3 4 5 6 7 8 9 6 -42 23 6 28 -100 65537 5 0 0 0 0 0
Sample Output
Scenario #1: 3 Scenario #2: 0 Scenario #3: 5 Scenario #4:0
题目大意:给你一组序列,只能交换相邻元素的位置,问你最少需要交换多少次,使得该序列非递减。
解体思路:首先证明最少交换次数为逆序数,接着用归并排序求出逆序数就行了。
证明如下:可以先将最大的数放到序列的最末端,因为只能交换相邻的元素,所以需要交换的次数正好等于其逆序数,最后就可以删除该数(不用再考虑这个数)。接着轮到原序列中第二大的数,重复上述步骤。因为在交换的时候每一步都不是多余的,且没有更优的交换方法,所以最后会发现,最少交换次数为所有数的逆序数之和。
代码如下:
#include<stdio.h> #include<string.h> int a[1010]; int b[1010]; int count; void Mesg(int l,int mid,int r){ int i=l; int j=mid+1;; int k=l; while(i<=mid&&j<=r){ if(a[i]>a[j]){ b[k++]=a[j]; count+=mid+1-i; j++; } else{ b[k++]=a[i]; i++; } } while(i<=mid){ b[k++]=a[i]; i++; } while(j<=r){ b[k++]=a[j]; j++; } for(int c=l;c<=r;c++){ a[c]=b[c]; } } void Mesgsort(int l,int r){ if(l<r){ int mid=(l+r)/2; Mesgsort(l,mid); Mesgsort(mid+1,r); Mesg(l,mid,r); } } int main(){ int t,k,n; scanf("%d",&t); k=1; while(t--){ scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",a+i); } count=0; Mesgsort(0,n-1); printf("Scenario #%d:\n%d\n\n",k++,count); } return 0; }