zoukankan      html  css  js  c++  java
  • 1089. Insert or Merge (25)

    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:

    10
    3 1 2 8 7 5 9 4 6 0
    1 2 3 7 8 5 9 4 6 0
    

    Sample Output 1:

    Insertion Sort
    1 2 3 5 7 8 9 4 6 0
    

    Sample Input 2:

    10
    3 1 2 8 7 5 9 4 0 6
    1 3 2 8 5 7 4 9 0 6
    

    Sample Output 2:

    Merge Sort
    1 2 3 8 4 5 7 9 0 6

    #include<iostream>
    using namespace std;
    #include<cstdio>
    #include<cstring>
    #include<vector>
    #include<algorithm>
    void output(vector<int> vt){
    	int i,j;
    	int size = vt.size();
    	for(i=0;i<size;i++){
    		if(i+1==size){
    			printf("%d
    ",vt[i]);
    		}else{
    			printf("%d ",vt[i]);
    		}
    	}
    }
    int main(){
    	int n;
    	vector<int>first;
    	vector<int>after;
    	int data;
    	scanf("%d",&n);
    	int i,j,k;
    	for(i=0;i<n;i++){
    		scanf("%d",&data);
    		first.push_back(data);
    	}
    	for(i=0;i<n;i++){
    		scanf("%d",&data);
    		after.push_back(data);
    	}
    	bool isInsert = true;
    	for(i=1;i<n;i++){
    		if(after[i-1]>after[i]){
    			break;
    		}
    	}
    	int index=i;
    	for(i=index;i<n;i++){
    		if(after[i]!=first[i]){
    			isInsert=false;
    			break;
    		}
    	}
    	if(isInsert){
    		printf("Insertion Sort
    ");
    		sort(after.begin(),after.begin()+index+1);
    		output(after);
    	}else{
    		printf("Merge Sort
    ");
    		bool find = false;
    		int step=1;
    		int from,to;
    		while(1){
    			step*=2;
    			for(i=0;i*step<n;i++){
    				from=i*step;
    				to = (from+step<n)?from+step:n;
    				sort(first.begin()+from,first.begin()+to);
    			}
    			if(find){
    				output(first);
    				break;
    			}
    			if(after == first){
    				find = true;
    			}
    		}
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    iOS5.1下emoji表情显示方框的解决办法
    iPhone处理图片(UIImage扩展类) 自动适应frame大小方法
    10个必需的iOS开发工具和资源
    转一篇:iOSOpenDev环境搭建以及使用
    自定义UITabbarController引发的血案
    (转) iphone开发资源汇总
    分类分享一下,关于push推送的经验吧
    关于IPHONE的设计模式
    IOS自动化打包介绍
    带有可变参数表的简化的printf函数
  • 原文地址:https://www.cnblogs.com/grglym/p/8288683.html
Copyright © 2011-2022 走看看