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

题目大意：给出一个初始序列，对它使用插入排序或堆排序法进行排序，先给出一个序列，问它是由插入排序产生还是堆排序产生，并输出下一步将会产生的序列。
直接模拟插入排序和堆排序的每一步过程。

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 111;
int origin[maxn], temp[maxn], changed[maxn];
int n;
bool isSame(int a[], int b[]) {
    for(int i = 1; i <= n; i++) {
        if(a[i] != b[i]) {
            return false;
        }
    }
    return true;
}
bool showArray(int a[]) {
    for(int i = 1; i <= n; i++) {
        printf("%d", a[i]);
        if(i < n) {
            printf(" ");
        }
    }
    printf("\n");
}
bool insertSort() {
    bool flag = false;
    for(int i = 2; i <= n; i++) {
        if(i != 2 && isSame(temp, changed)) {
            flag = true;
        }
        sort(temp, temp + i + 1);
        if(flag == true) {
            return true;
        }
    }
    return false;
}
void downAdjust(int low, int high) {
    int i = low, j = i * 2;
    while(j <= high) {
        if(j + 1 <= high && temp[j + 1] > temp[j]) {
            j = j + 1;
        }
        if(temp[j] > temp[i]) {
            swap(temp[j], temp[i]);
            i = j;
            j = i * 2;
        } else {
            break;
        }
    }
}
void headSort() {
    bool flag = false;
    for(int i = n / 2; i >= 1; i--) {
        downAdjust(i, n);
    }
    for(int i = n; i > 1; i--) {
        if(i != n && isSame(temp, changed)) {
            flag = true;
        }
        swap(temp[i], temp[1]);
        downAdjust(1, i - 1);
        if(flag == true) {
            showArray(temp);
            return;
        }
    }
}
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &origin[i]);
        temp[i] = origin[i];
    }
    for(int i = 1; i <= n; i++) {
        scanf("%d", &changed[i]);
    }
    if(insertSort()) {
        printf("Insertion Sort\n");
        showArray(temp);
    } else {
        printf("Heap Sort\n");
        for(int i = 1; i <= n; i++) {
            temp[i] = origin[i];
        }
        headSort();
    }
    return 0;
}

1098 Insertion or Heap Sort（25 分）

猜你喜欢