本文同步发布在CSDN:https://blog.csdn.net/weixin_44385565/article/details/90941941

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 (≤). 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 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 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

题目大意: 对N个数据进行排序,给出排序过程中的数据,判断是插入排序还是堆排序,然后输出下一步排序得到的数列。

思路:判断排序方法,前面是从小到大排列,后面的数据跟原始数据相同的就是插入排序,否则为堆排序。

插入排序的下一步操作就是把下一个数字插入到前面合适的位置。

堆排序的首个数字是当前大顶堆的根,将它与堆的最后一个节点(从后往前找,第一个小于根节点的数就是当前堆的最后一个节点)交换位置,然后再对根节点进行堆化操作。

测试点0、2、4是插入排序,1、3、5是堆排序。(不要问我是怎么知道的~)

 #include <iostream>
#include <vector>
using namespace std;
int N;
vector <int> v1, v2;
int maxIndex(int a, int b, int c, int n);
bool fun();
void adjust(int index, int n);
void swap(int& a, int& b);
int main()
{
scanf("%d", &N);
v1.resize(N);
v2.resize(N);
for (int i = ; i < N; i++)
scanf("%d", &v1[i]);
for (int i = ; i < N; i++)
scanf("%d", &v2[i]);
bool flag = fun();//判断排序方式
if (flag) {//插入排序
int index, tmp, j;
for (int i = ; i < N; i++)
if (v2[i] < v2[i - ]) {
index = i;
tmp = v2[index];
break;
}
for (j = index; j > && v2[j - ] > tmp; j--)
v2[j] = v2[j - ];
v2[j] = tmp;
printf("Insertion Sort\n");
}
else {//堆排序
int index, tmp;
for (int i = N - ; i >= ; i--)
if (v2[] > v2[i]) {
index = i;
tmp = v2[index];
break;
}
v2[index] = v2[];
v2[] = tmp;
adjust(, index - );
printf("Heap Sort\n");
}
for (int i = ; i < N; i++) {
printf("%d", v2[i]);
if (i < N - )
printf(" ");
}
return ;
}
void adjust(int index, int n) {
int max;
while (index * + <= n ) {
max = maxIndex(index, index * + , index * + , n);//寻找当前节点与其孩子之间的最大值的下标
if (index == max)//若最大值是自己,则退出循环
break;
swap(v2[index], v2[max]);
index = max;
}
}
int maxIndex(int a, int b, int c, int n) {
if (v2[b] > v2[a])
a = b;
if (c <= n && v2[c] > v2[a])
a = c;
return a;
}
void swap(int& a, int& b) {
int c = a;
a = b;
b = c;
}
bool fun() {
int i, index = ;
for (i = ; i < N; i++)
if (v2[i] < v2[i - ]) {
index = i;
break;
}
for (int i = index; i < N; i++) {
if (v1[i] != v2[i])
return false;
}
return true;
}

PAT甲级——1098 Insertion or Heap Sort (插入排序、堆排序)的更多相关文章

  1. PAT甲级1098. Insertion or Heap Sort

    PAT甲级1098. Insertion or Heap Sort 题意: 根据维基百科: 插入排序迭代,消耗一个输入元素每次重复,并增加排序的输出列表.在每次迭代中,插入排序从输入数据中删除一个元素 ...

  2. pat 甲级 1098. Insertion or Heap Sort (25)

    1098. Insertion or Heap Sort (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yu ...

  3. PAT甲级——A1098 Insertion or Heap Sort

    According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and gr ...

  4. PAT Advanced 1098 Insertion or Heap Sort (25) [heap sort(堆排序)]

    题目 According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and ...

  5. 1098 Insertion or Heap Sort——PAT甲级真题

    1098 Insertion or Heap Sort According to Wikipedia: Insertion sort iterates, consuming one input ele ...

  6. 1098 Insertion or Heap Sort

    1098 Insertion or Heap Sort (25 分) According to Wikipedia: Insertion sort iterates, consuming one in ...

  7. PAT甲题题解1098. Insertion or Heap Sort (25)-(插入排序和堆排序)

    题目就是给两个序列,第一个是排序前的,第二个是排序中的,判断它是采用插入排序还是堆排序,并且输出下一次操作后的序列. 插入排序的特点就是,前面是从小到大排列的,后面就与原序列相同. 堆排序的特点就是, ...

  8. 【PAT甲级】1098 Insertion or Heap Sort (25 分)

    题意: 输入一个正整数N(<=100),接着输入两行N个数,表示原数组和经过一定次数排序后的数组.判断是经过插入排序还是堆排序并输出再次经过该排序后的数组(数据保证答案唯一). AAAAAcce ...

  9. PAT (Advanced Level) Practise - 1098. Insertion or Heap Sort (25)

    http://www.patest.cn/contests/pat-a-practise/1098 According to Wikipedia: Insertion sort iterates, c ...

随机推荐

  1. [转]_int64、long long 的区别

    大学生程序代写 C++的64位整数[原]by 赤兔 http://baike.baidu.com/view/1235293.htm 在做ACM题时,经常都会遇到一些比较大的整数.而常用的内置整数类型常 ...

  2. 用nginx搭建http/rtmp/hls协议的MP4/FLV流媒体服务器

    前前后后搭建了两三个星期,终于可以告一段落,nginx实在是有点强大.写一篇笔记来记录一下这个过程中的思路和解决方案. 一.搭建nginx平台: 基本是基于http://blog.csdn.net/x ...

  3. Winform程序实现多显示屏、多屏幕显示的2种方法

    这篇文章主要介绍了Winform窗口实现多显示屏显示的2种方法,本文直接给出了实现代码,并对其中的一些重要参数做了解释,需要的朋友可以参考下. 一台主机连接了2台显示器(2个显卡),要求一个程序的两个 ...

  4. HUE,大数据的SQL Shell

    1. HUE需要安装SASL 发现异常: Could not install table: Error creating table sample_07: Could not start SASL: ...

  5. 不重启linuxVMWare虚拟机添加虚拟磁盘

    Vsphere Client找到要添加磁盘的虚机,如图所示   点击虚机右键,在出现的下列列表中选择“编辑设置”如图   在打开的虚拟机属性中,在”硬件对话框点击“添加"按钮,如图   在添 ...

  6. HDU1548(楼梯问题bfs)

    #include"cstdio" #include"queue" #include"cstring" using namespace std ...

  7. CSS3 日常小结

    1. pointer-events:none; 2. flex 今天看到一个牛X的CSS3属性 flex, 称为弹性盒子.  这中属性完全可以替代媒体查询啦 使用方法: 父元素使用属性display ...

  8. 第二课 go语言的结构

    1 go 语言结构 package main import "fmt" func main() { /* 这是我的第一个简单的程序 */ fmt.Println("Hel ...

  9. AD9 如何画4层pcb板

    新建的PCB文件默认的是2层板,教你怎么设置4层甚至更多层板. 在工具栏点击Design-->Layer Stack Manager.进入之后显示的是两层板,添加为4层板,一般是先点top la ...

  10. mkfs在特定的分区上建立 linux 文件系统

    Linux mkfs命令用于在特定的分区上建立 linux 文件系统 使用方式 : mkfs [-V] [-t fstype] [fs-options] filesys [blocks]参数 :    ...