本文共 2708 字，大约阅读时间需要 9 分钟。

Brainman

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 12671		Accepted: 6373

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

44 2 8 0 310 0 1 2 3 4 5 6 7 8 96 -42 23 6 28 -100 655375 0 0 0 0 0

Sample Output

Scenario #1:3Scenario #2:0Scenario #3:5Scenario #4:0

Source

, Darmstadt, Germany

大致题意：

给出长度为n的序列，每次只能交换相邻的两个元素，问至少要交换几次才使得该序列为递增序列。

解题思路：

观察规律，其实就是求有几个逆序对。

以第一个例子4 2 8 0 3为例，

对于2而言，后面比2小的只有1个数；

对于8而言，后面比8小的只有2个数；

对于0而言，只有0个数；

对于3，只有0个数。

所以总的逆序对数为：1+2+0+0=3。

代码：

#include
   
    using namespace std;int a[10000];int main(){    int ans,t,n;    cin>>t;    for(int i=1;i<=t;i++)    {        ans=0;        cin>>n;//读入        for(int j=1;j<=n;j++)            cin>>a[j];        for(int j=1;j
    
     a[k])                ans++;            }       cout<<"Scenario #"<
     <<":"<
    
   

 

 

转载地址：https://joycez.blog.csdn.net/article/details/83064917 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！