Brainman
2015-12-06 10:33
477 查看
Brainman
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
BackgroundRaymond 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.
输入
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.
输出
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 sortthe given sequence. Terminate the output for the scenario with a blank line.
示例输入
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
示例输出
Scenario #1: 3 Scenario #2: 0 Scenario #3: 5 Scenario #4: 0
来源
TUD Programming Contest 2003#include "stdio.h" #define M 1002 int main() { int a[M],n,i,j,k,s,t; scanf("%d",&t); for(i=1;i<=t;i++) { scanf("%d",&n); for(j=0;j<n;j++) scanf("%d",a+j); s=0; for(j=0;j<n;j++) { for(k=j+1;k<n;k++) { if(a[j]>a[k]) s++; } } printf("Scenario #%d:\n%d\n\n",i,s); } return 0; }
相关文章推荐
- Bad Hair Day
- train test 划分 转自 http://blog.sina.com.cn/s/blog_6a90ae320101a5rc.html
- 1014. Waiting in Line (30)
- mybaits学习笔记(一)
- DNA repair
- hdoj Airport 5046 () 好题
- 如果人工智能就在不远的未来,你该怎样布局当下?
- 【PAT】1106. Lowest Price in Supply Chain (25)
- 模块度与Louvain社区发现算法
- lightoj1366Pair of Touching Circles
- Configure Domain Classes(配置领域类)【EF Code-First 系列】
- ML、CV和AI等领域的一些顶级会议
- Project Euler 95:Amicable chains 亲和数链
- http://airos.blog.51cto.com/10853324/1719870
- 马尔可夫聚类算法(MCL)
- Timus Online Judge 1577 E-mail(字符串DP)
- SaltStack入门(二)Grains、NoteGroup和State
- Assertion failure in -[MASViewConstraint install]
- HDOJ--2674--N!Again
- fatal error LINK1123:failure during conversion to COFF:file invalid or corrupt