Brainman
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 7444 | Accepted: 4068 |
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
Source
TUD Programming Contest 2003, Darmstadt, Germany
解题思路:我直接模拟了归并排序的过程,直接看程序就可以了。还有一种方法是求数列的逆序数,因为根据题目所给条件,逆序数就是交换次数,代码一并贴出。
求逆序数:
还有这一题和2299买一送一。
解题思路:我直接模拟了归并排序的过程,直接看程序就可以了。还有一种方法是求数列的逆序数,因为根据题目所给条件,逆序数就是交换次数,代码一并贴出。
#include<iostream>
using namespace std;
int main()
{
long i,j,k,m,n,ans,s=1,*num;
bool flag;
cin>>n;
while(n--)
{
ans=0;
cin>>m;
num=new long[m+1];
for(k=0;k<m;k++)
cin>>num[k];
do
{
flag=true;//flag用以判断排序是否完成
i=m/2-1;j=m/2;//先排中间的两个元素
if(num[i]>num[j])
{
swap(num[i],num[j]);
ans++;
flag=false;
}
i=0;j=1;//排左边的元素
while(j<=m/2)
{
if(num[i]>num[j])
{
swap(num[i++],num[j++]);
ans++;
flag=false;
}
i++;j++;
}
i=m/2;j=m/2+1;//排右边的元素
while(j<m)
{
if(num[i]>num[j])
{
swap(num[i++],num[j++]);
ans++;
flag=false;
}
i++;j++;
}
}while(!flag);
cout<<"Scenario #"<<s++<<":"<<endl<<ans<<endl<<endl;
}
return 0;
}
求逆序数:
/*直接求逆序数O(n^2)*/
//Memory Time
//220K 188MS
#include <iostream>
using namespace std;
int main(int i,int j)
{
int test;
cin>>test;
for(int p=1;p<=test;p++)
{
int n;
cin>>n;
int* s=new int[n+1];
for(i=1;i<=n;i++)
cin>>s[i];
int t=0; //s[]的逆序数
for(i=1;i<=n-1;i++) //把S[i]和s[i+1~n]的元素逐个比较
for(j=i+1;j<=n;j++)
if(s[i]>s[j]) //如果s[i] > s[j] (j∈[i+1,n])
t++; //则逆序数t++
cout<<"Scenario #"<<p<<':'<<endl<<t<<endl<<endl;
delete s;
}
return 0;
}
还有这一题和2299买一送一。