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 1904 Brainman(归并求逆序数)

#include #include #include #include using namespace std; int a[1005]; int c[1005]; int n,cnt; void...
  • u012198382
  • u012198382
  • 2014年08月28日 14:14
  • 546

POJ 1804-Brainmanp【逆序对】

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 9472   Accep...
  • qq_29600137
  • qq_29600137
  • 2016年05月19日 22:07
  • 324

poj1804(归并排序求逆序数)

逆序数,也就是说,对于n个不同的元素,先规定各元素之间有一个标准次序(例如n个 不同的自然数,可规定从小到大为标准次序),于是在这n个元素的任一排列中,当某两个元素的先后次序与标准次序不同时,就说有1...
  • u014569598
  • u014569598
  • 2014年12月22日 12:46
  • 630

poj1804 归并排序求逆序对

#include #include #include using namespace std; const int maxn=1005; int tmp[maxn],a[maxn]; int ans;...
  • Loi_black
  • Loi_black
  • 2016年10月09日 21:54
  • 382

POJ 1804(最小相邻数移动)

题目大意:对乱序列相邻2数移动,使得用最小步数使其有序 解法:归并排序 定理: 一个乱序序列的逆序数 = 在只允许相邻两个元素交换的条件下,得到有序序列的交换次数 Program P1804;...
  • nike0good
  • nike0good
  • 2012年09月01日 17:11
  • 1220

POJ1804-Brainman【借助Mergesort求逆序数O(nlogn)】

  • 2011年07月31日 00:10
  • 7KB
  • 下载

POJ1804-Brainman

转载请注明出处:優YoU http://user.qzone.qq.com/289065406/blog/1304317886   大致题意: 和POJ2299一摸一样,区别在于数据规模缩小...
  • lyy289065406
  • lyy289065406
  • 2011年07月30日 21:27
  • 2526

POJ1804 Brainman (逆序对)

题目大意: 给定一个序列,求逆序对。 思路:枚举统计逆序对个数:# include # include int a[10000]; int main(){ int ans,i,j,k,t,...
  • qq_35124363
  • qq_35124363
  • 2016年06月04日 17:13
  • 328

POJ 1804 Brainman

Brainman Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 9094   Accepted: 4879 ...
  • xuhuanfeng232
  • xuhuanfeng232
  • 2015年11月21日 19:59
  • 882

Brainman

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

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