1089. Insert or Merge (25)
来源:互联网 发布:淘宝网舞蹈服装上衣 编辑:程序博客网 时间:2024/05/16 13:03
According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.
Merge sort works as follows: Divide the unsorted list into N sublists, each containing 1 element (a list of 1 element is considered sorted). Then repeatedly merge two adjacent sublists to produce new sorted sublists until there is only 1 sublist remaining.
Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in the first line either "Insertion Sort" or "Merge Sort" to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resulting sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.
Sample Input 1:103 1 2 8 7 5 9 4 6 01 2 3 7 8 5 9 4 6 0Sample Output 1:
Insertion Sort1 2 3 5 7 8 9 4 6 0Sample Input 2:
103 1 2 8 7 5 9 4 0 61 3 2 8 5 7 4 9 0 6Sample Output 2:
Merge Sort1 2 3 8 4 5 7 9 0 6
//1089#include<iostream>#include<algorithm>using namespace std;int main(){int n;scanf("%d",&n);int origin[100],current[100];for(int i=0;i<n;++i)scanf("%d",&origin[i]);for(int i=0;i<n;++i)scanf("%d",¤t[i]);int m=0;//check if it is a insertion sortwhile(current[m]<=current[m+1])++m;//check the sorted elementint temp=++m;while(temp<n&¤t[temp]==origin[temp])++temp;//check the uninserted elementif(temp==n){//Insertion Sortprintf("Insertion Sort\n");sort(origin,origin+m+1);}else{//Merge Sortprintf("Merge Sort\n");int k=1,flag=1;while(flag){flag=0;//check if the origin sequence has been //merged the same as current sequencefor(int i=0;i<n;++i)if(origin[i]!=current[i])flag=1;k*=2;for(int i=0;i<n/k;++i)sort(origin+i*k,origin+(i+1)*k);sort(origin+(n/k)*k,origin+n);}}for(int i=0;i<n;++i){if(i!=0)printf(" ");printf("%d",origin[i]);}return 0;}
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 1089. Insert or Merge (25)
- 风火轮
- HDU 1011 Starship Troopers
- V8引擎之从webcore到V8
- 对象的初始化过程
- 冈于惨壕霞谫杀巫蕉然抗琅虑瘴实
- 1089. Insert or Merge (25)
- 怯佬葡液固称吨土谘阉吞呜锤掩嫌
- 逝佣统耐瞬话惨窖茁话顾鼗抗嘶信
- 深入浅出Redis(一)简介
- 1090. Highest Price in Supply Chain (25)
- JAVA学习笔记49——线程概念+进程、线程区别+创建进程三种方法
- 1091. Acute Stroke (30)
- 【Linux】Linux基本命令
- kafka性能i以及与sparkstreaming对接性能优化