POJ 1804 Brainman

原创 2015年11月21日 19:59:17
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: 
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.

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求逆序数

http://poj.org/problem?id=1804 和poj 2299一样的题。 Brainman Time Limit: 1000MS   Memory Limi...

poj&nbsp;1804&nbsp;(归并排序求逆序数)Bra…

Brainman Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6471 Accepted: 3585 ...

Brainman (P1804)

一开始还害得我去用树状数组,结果是错的思路, 就是用冒泡排序法就可以了。 #include //#include using namespace std; //freopen(...

poj 1804 Brainman(求逆序对)

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

POJ 1804 Brainman

 本题求将一个序列排序成有序序列所需要的最少交换次数,交换只能相邻交换可以知道,最少次数就等于原序列的逆序对数BrainmanTime Limit: 1000MS Memory Limit: 3000...

POJ 1804 Brainman 分治排序求逆序对

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 10955   Acce...

poj_2299Ultra-QuickSort && poj_1804Brainman

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 32487 ...

POJ 1804-Brainmanp【逆序对】

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

poj--1804

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 9113   Accep...
  • MBLHQ
  • MBLHQ
  • 2015年11月26日 12:44
  • 139

Brainman

Brainman Time Limit: 1000ms   Memory limit: 65536K  有疑问?点这里^_^ 题目描述 Background Raymond B...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1804 Brainman
举报原因:
原因补充:

(最多只允许输入30个字)