solution Of 1098. Insertion or Heap Sort (25)

1098. Insertion or Heap Sort (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.

Heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. it involves the use of a heap data structure rather than a linear-time search to find the maximum.

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 “Heap 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 resuling 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 6 0
6 4 5 1 0 3 2 7 8 9
Sample Output 2:
Heap Sort
5 4 3 1 0 2 6 7 8 9

---

结题思路 :
题意要求我们根据排序过程中的数组判断排序方式，并输出下一步的结果。
要求1：插入排序首部开始逐渐有序，堆排序尾部开始逐渐有序；
要求2：堆排序有序部分不再参与排序，通过得到的最后排序结果哦按段堆排序的有序部分。

程序步骤：
第一步、判断输入是否为插入排序；
第二步、根据对应排序，输出下一步排序结果即可。

具体程序(AC)如下：

---

#include <iostream>#include <vector>#include <algorithm>using namespace std;vector<int> init;vector<int> after;void Insertion_Sort(int p)//next_step{    int value=after[p];    for(int i=0;i<p;++i)        if(after[i]>value)        {            for(int j=p-1;j>=i;--j)                after[j+1]=after[j];            after[i]=value;            break;        }    return;}void down_filter(int p){    int start=0;    int value=after[start];    for(int i=2*start+1;i<=p;i=i*2+1)    {        if(i<p&&after[i]<after[i+1])            ++i;        if(value>after[i])            break;        after[start]=after[i];        start=i;    }    after[start]=value;}void Heap_Sort(){    sort(init.begin(),init.end());    int num=after.size();    int p;    for(int i=num-1;i>=0;--i)    {        if(after[i]==init[i])            p=i;        else            break;    }    int value=after[0];    after[0]=after[p-1];    after[p-1]=value;    down_filter(p-2);}int main(){    int num;    cin>>num;    init.resize(num);    after.resize(num);    int i;    for(i=0;i<num;++i)        cin>>init[i];    int p=0;    bool flag=true;    cin>>after[0];    for(i=1;i<num;++i)    {        cin>>after[i];        if(after[i]>=after[i-1]&&flag)            p=i;        else            flag=0;    }    for(i=p+1;i<num;++i)        if(after[i]!=init[i])            break;    if(i>=num)//插入排序    {        cout<<"Insertion Sort"<<endl;        Insertion_Sort(p+1);    }    else//堆排序    {        cout<<"Heap Sort"<<endl;        Heap_Sort();    }    cout<<after[0];    for(i=1;i<num;++i)        cout<<" "<<after[i];    cout<<endl;    return 0;}