Brainman (P1804)
来源:互联网 发布:禁毒网络知识竞赛网址 编辑:程序博客网 时间:2024/06/06 23:57
一开始还害得我去用树状数组,结果是错的思路,
就是用冒泡排序法就可以了。
#include<iostream>//#include<algorithm>using namespace std;//freopen("C://i.txt","r",stdin);#define N 2000008int go[1111];int main(){freopen("C://i.txt","r",stdin);int i,j,k;int n;int cas;cin>>cas;int num=0;while (cas--){num++;cin>>n;for (i=0;i<n;i++)cin>>go[i];int ans=0;for (i=0;i<n;i++){for (j=1;j<n;j++){ if (go[j]<go[j-1]) { swap(go[j],go[j-1]); ans++; }}}cout<<"Scenario #"<<num<<':'<<endl;cout<<ans<<endl;cout<<endl;}}
Brainman
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7166 Accepted: 3928
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
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
- Brainman (P1804)
- Brainman
- Brainman
- 洛谷p1804
- PKU1804 brainman
- POJ1804 Brainman
- 【poj1804】 Brainman
- POJ1804-Brainman
- [POJ1804]Brainman
- POJ 1804 Brainman
- poj 1804 Brainman
- POJ 1804 Brainman
- POJ 1804 Brainman
- poj 1804 Brainman
- poj 1804 Brainman
- poj 1804:Brainman
- POJ 1804 Brainman
- POJ 1804 Brainman
- 网络编程
- UltraShadow Technology
- UltraShadow II Technology
- iPhone开发之确认网络环境
- UltraShadow 技术
- Brainman (P1804)
- JSP数据类型
- java exe swt
- MyBatis3.1.1 增上改查源码实例
- org.json.JSONObject的optXXX方法讲解
- UVa 10624 - Super Number, Rujia Liu的神题(四)
- UltraShadow II 加速阴影计算
- Android中如何获取字符或者字符串的宽度
- C#中enum的总结