小白算法练习 归并排序 POJ Brainman lanqiao
来源:互联网 发布:excel大量数据统计 编辑:程序博客网 时间:2024/05/29 16:15
Brainman
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11001 Accepted: 5676
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
Code
#include<iostream>#include<cstring>using namespace std;const int Max=10008;int b[Max]={0};int counts;void Merge(int a[],int f,int mid,int e){int ml=f;int mr=mid+1;int len=e-f;int num=0;while(ml<=mid && mr<=e){if(a[ml]>a[mr]){b[num++]=a[mr++];counts+=mid-ml+1;}else{b[num++]=a[ml++];}}if(ml>mid){while(mr<=e){b[num++]=a[mr++];}}else{while(ml<=mid){b[num++]=a[ml++];}}for(int i=0;i<=len;i++){a[f+i]=b[i];}return;}void MergeSort(int a[],int f,int e){if(f<e){int mid=(f+e)>>1;MergeSort(a,f,mid);MergeSort(a,mid+1,e);Merge(a,f,mid,e); }elsereturn;}int main(){int T;cin>>T;for(int k=1;k<=T;k++){int c;cin>>c;int a[Max]={0};for(int i=1;i<=c;i++){cin>>a[i];}counts=0;memset(b,0,sizeof(b));MergeSort(a,1,c);cout<<"Scenario #"<<k<<":"<<'\n';cout<<counts<<"\n";cout<<endl;}return 0;}
阅读全文
0 0
- 小白算法练习 归并排序 POJ Brainman lanqiao
- 小白算法练习 二分搜素练习 Drying POJ 3104 lanqiao 二分
- lanqiao 小白算法练习 k好数 数位dp
- lanqiao 小白算法练习 合并石子 区间dp
- 小白算法练习 lanqiao SPFA+vector 模板
- POJ 1804 Brainman(归并排序)
- 小白算法练习 简单背包专题003 完全背包 hdu lanqiao 包子凑数 dp
- 小白算法练习 安慰奶牛 最小生成树 lanqiao prim
- poj 1804 Brainman(归并排序求逆序对)
- POJ 1804 Brainman (归并排序 -- 求逆序对数)
- poj 1804 (归并排序求逆序数)Brainman
- poj 1804 Brainman(归并)
- 算法练习-归并排序
- POJ 1904 Brainman(归并求逆序数)
- poj 1804 (nyoj 117)Brainman : 归并排序求逆序数
- POJ 1804 Brainman && zzulioj 1470: Car race game(归并排序)
- POJ 1804 Brainman、 EOJ 3234 Sort(归并排序+逆序对)
- POJ1804-Brainman(归并排序求逆序数)
- SprinTool Susite 使用Maven引入外部jar包步骤
- QT 下 json格式数据的 生成 和 解析
- 直接选择排序
- HDU
- 【Java概念】接口(11)
- 小白算法练习 归并排序 POJ Brainman lanqiao
- 浅谈ES6 块级作用域
- 1016. 部分A+B (15)--PAT乙级
- AtCoder Grand Contest 001 E
- pycharm笔记--设置字体大小
- DOM操作动态增加表格
- springmvc处理流程
- 语义化,让你的网页更好的被搜索引擎理解
- wildcard-matching