POJ 1804-Brainmanp【逆序对】
2016-05-19 22:07
417 查看
Brainman
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
Sample Output
Source
TUD Programming Contest 2003, Darmstadt, Germany
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 9472 | Accepted: 5052 |
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
TUD Programming Contest 2003, Darmstadt, Germany
#include<stdio.h> #include<cstring> long long cnt; int a[100000+100],c[100000+100]; void merge(int a[], int first, int mid, int last, int c[]) { int i = first, j = mid + 1; int m = mid, n = last; int k = 0; while(i <= m || j <= n) { if(j > n || (i <= m && a[i] <= a[j])) c[k++] = a[i++]; else { c[k++] = a[j++]; cnt += (m - i + 1); } } for(i = 0; i < k; i++) a[first + i] = c[i]; } void merge_sort(int a[], int first, int last, int c[]) { if(first < last) { int mid = (first + last) / 2; merge_sort(a, first, mid, c); merge_sort(a, mid+1, last, c); merge(a, first, mid, last, c); } } int main() { int n; int t; scanf("%d",&t); int gg=0; while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } cnt=0; memset(c,0,sizeof(c)); merge_sort(a,0,n-1,c); printf("Scenario #%d:\n",++gg); printf("%lld\n",cnt); if(t!=0) printf("\n"); } return 0; }
相关文章推荐
- Codeforces Round #353 (Div. 2) -- B. Restoring Painting (规律)
- HDU 2457 DNA repair
- the server ssl certificate failed to verify
- UVA - 10976 Fractions Again?!
- 1014. Waiting in Line (30)
- HDU 1151 - Air Raid
- How to send Email through external SMTP server on Ubuntu 14.04
- HDU1789Doing Homework again(贪心)
- AIDL 进程间通信
- Principles of training multi-layer neural network using backpropagation
- main函数参数的用法
- 使用AIDL实现进程间的通信之复杂类型传递
- 使用AIDL实现进程间的通信
- JetBrains重大安全升级!
- 70. Climbing Stairs
- 127_AIDL的使用
- c 语言模块接口函数在main之前注册
- Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of a
- xcode7 解决NSURLConnection/CFURLConnection HTTP load failed (kCFStreamErrorDomainSSL, -9843)
- maven打好的jar包如何在运行时指定main-class