POJ 1804 Brainman

Brainman
 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 9094 Accepted: 4879

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:
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.

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

#include <iostream>
#include <cstring>
using namespace std;

const int maxn=1000+5;
int a[maxn],t[maxn];
int ans=0;

void mergesort(int l,int r){

if(l+1<r){
int m=l+(r-l)/2;
int p=l,q=m,i=l;
mergesort(l,m);
mergesort(q,r);

while(p<m || q<r){
if(q>=r || (p<m && a[p]<=a[q])) t[i++]=a[p++];
else {
t[i++]=a[q++];
ans+=m-p;
}
}
for(int i=l;i<r;i++) a[i]=t[i];
}
}
int main(){

int tmp;
cin>>tmp;
for(int j=1;j<=tmp;j++){
int n;
cin>>n;
ans=0;
memset(a,0,sizeof(a));
memset(t,0,sizeof(t));

for(int i=0;i<n;i++)
cin>>a[i];
mergesort(0,n);
cout<<"Scenario #"<<j<<":"<<endl;
cout<<ans<<endl<<endl;
}
return 0;
}


• 本文已收录于以下专栏：

poj 1804 Brainman(求逆序对)

Description Background  Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 24...

POJ 1904 Brainman(归并求逆序数)

#include #include #include #include using namespace std; int a[1005]; int c[1005]; int n,cnt; void...

POJ1804-Brainman

DescriptionBackground Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246...

POJ 1804 Brainman

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 8954   Accep...

poj 1804 Brainman（归并）

http://blog.acmj1991.com/?p=776 思路：求逆序数 思路：开始理解错了，以为是用最少的交换次数使数列变成递增数列。后来才知道理解错了，但是可以吧这种想法的代码贴出来...

poj 1804 Brainman

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 7873   Accep...

POJ1804-Brainman

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)