1035. 插入与归并(25)
时间限制
200 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
根据维基百科的定义:
插入排序是迭代算法,逐一获得输入数据,逐步产生有序的输出序列。每步迭代中,算法从输入序列中取出一元素,将之插入有序序列中正确的位置。如此迭代直到全部元素有序。
归并排序进行如下迭代操作:首先将原始序列看成N个只包含1个元素的有序子序列,然后每次迭代归并两个相邻的有序子序列,直到最后只剩下1个有序的序列。
现给定原始序列和由某排序算法产生的中间序列,请你判断该算法究竟是哪种排序算法?
输入格式:
输入在第一行给出正整数N (<=100);随后一行给出原始序列的N个整数;最后一行给出由某排序算法产生的中间序列。这里假设排序的目标序列是升序。数字间以空格分隔。
输出格式:
首先在第1行中输出“Insertion Sort”表示插入排序、或“Merge Sort”表示归并排序;然后在第2行中输出用该排序算法再迭代一轮的结果序列。题目保证每组测试的结果是唯一的。数字间以空格分隔,且行末不得有多余空格。输入样例1:
10 3 1 2 8 7 5 9 4 6 0 1 2 3 7 8 5 9 4 6 0输出样例1:
Insertion Sort 1 2 3 5 7 8 9 4 6 0输入样例2:
10 3 1 2 8 7 5 9 4 0 6 1 3 2 8 5 7 4 9 0 6输出样例2:
Merge Sort 1 2 3 8 4 5 7 9 0 6
该题目前得分11分,再思考,现在思路太混乱了
void MergeArray(int a[],int first,int mid,int last,int temp[])//归并排序中的数组融合 { int n = mid, m = last; int i = first, j = mid + 1, k = 0; while ((i <= n) && (j<=m)) { if (a[i] < a[j]) { temp[k] = a[i]; k++; i++; } else { temp[k] = a[j]; j++; k++; } } while (i<=n) { temp[k] = a[i]; i++; k++; } while (j<=m) { temp[k] = a[j]; k++; j++; } for (int x = 0; x < k; x++) { a[first+k] = temp[k];//注意这里是first+k } } void MergeSort(int a[], int first, int last, int temp[]) { if (first < last) { int mid = (first + last) / 2; MergeSort(a, first, mid, temp); MergeSort(a, mid + 1, last, temp); MergeArray(a, first, mid, last, temp); } } int main() { int n; cin >> n; bool ifInsert = 0; /*int a[100] = { 0 }; int b[100] = { 0 }; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; }*/ int a[10] = { 3, 1, 2, 8, 7, 5, 9, 4, 0, 6 }; int b[10] = { 1, 3, 2, 8, 5, 7, 4, 9, 0, 6 }; int temp = 0; for (int i = 1; i < n; i++) { int key = a[i]; int j = i - 1; while ((j >= 0) && (a[j]>key)) { a[j + 1] = a[j]; j--; } a[j + 1] = key; int count = 0; for (int k = 0; k <n; k++) { if (a[k] == b[k]) { count++; } } if (count == n) { temp = i; ifInsert = true; break; } } if ((temp != 0) && (ifInsert==true)) { int jt = temp - 1 + 1;//key值为当前temp的下一个元素 int keyt = a[temp + 1]; while ((jt >= 0) && (a[jt] > keyt)) { a[jt + 1] = a[jt]; jt--; } a[jt + 1] = keyt; if (ifInsert == true) { cout << "Insertion Sort" << endl; } for (int i = 0; i < n; i++) { if (i) cout << " " << a[i]; else { cout << a[i]; } } } else if (ifInsert == false) { //将数组a进行归并排序 int *p = new int[100]; int first = 0; int last = n - 1; int num = 0; int flag = 0; int optf = 0; while (first<last) { flag++; int mid = (first + last) / 2;//这里是想写归并算法了,但是感觉思路没理清楚 last = mid; MergeArray(a, first, mid, last, p); for (int k = 0; k <n; k++) { if (a[k] == b[k]) { num++; } } if (num == n) { //满足条件了,要输出排序下一次循环的内容 optf = flag; } if (flag == (optf + 1)) { cout << "Merge Sort" << endl; for (int i = 0; i < n; i++) { if (i) cout << " " << a[i]; else { cout << a[i]; } } } } delete[] p; } return 0; }
第二版本代码,得分18分,仍有两个测试用例过不了,这题从早纠结到现在,思路基本理清了,但是边界条件应该还没有很好地照顾到
(参考了正确代码的思路,链接如下http://www.cnblogs.com/asinlzm/p/4442450.html)
#include<vector> #include <sstream> #include<cmath> #include<iomanip> #include<iostream> #include <ctype.h> #include <stdlib.h> #include <algorithm> using namespace std; void MergeArray(int a[],int first,int mid,int last,int temp[])//归并排序中的数组融合 { int n = mid, m = last; int i = first, j = mid + 1, k = 0; while ((i <= n) && (j<=m)) { if (a[i] < a[j]) { temp[k] = a[i]; k++; i++; } else { temp[k] = a[j]; j++; k++; } } while (i<=n) { temp[k] = a[i]; i++; k++; } while (j<=m) { temp[k] = a[j]; k++; j++; } for (int x = 0; x < k; x++) { a[first+x] = temp[x];//注意这里是first+k } } void Merge(int a[], int k, int len, int temp[])//用于每次迭代的步长控制k是每次的步长,2,4,8,16这样成倍增长 { if (k >= len) { k = len; } int start = 0, end = 0; for (int i = 0; i < len;) { start = i; end = (start + k>len ? len : start + k); int mid = (start + end-1) / 2;//这里是否加1呢 MergeArray(a, start, mid, end-1, temp); i = i + k; } } int main() { int n; cin >> n; bool ifInsert = false; int a[100] = { 0 }; int b[100] = { 0 }; int numa[100] = { 0 }; int num0[100] = { 0 }; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n; i++) { cin >> b[i]; } for (int i = 0; i < n; i++) { numa[i] = a[i]; } int temp = 0; for (int i = 1; i < n; i++)//插入排序的实现 { int key = a[i]; int j = i - 1; while ((j >= 0) && (a[j]>key)) { a[j + 1] = a[j]; j--; } a[j + 1] = key; int count = 0; for (int k = 0; k <n; k++) { if (a[k] == b[k]) { count++; } } if (count == n) { temp = i; ifInsert = true; break; } } if ((temp != 0) && (ifInsert==true)) { int jt = temp - 1 + 1;//key值为当前temp的下一个元素 int keyt = a[temp + 1]; while ((jt >= 0) && (a[jt] > keyt)) { a[jt + 1] = a[jt]; jt--; } a[jt + 1] = keyt; if (ifInsert == true) { cout << "Insertion Sort" << endl; } for (int i = 0; i < n; i++) { if (i) cout << " " << a[i]; else { cout << a[i]; } } } else if (ifInsert == false)//如果不是插入排序,判断是否为归并 { for (int i = 1;; ) { Merge(numa, i, n, num0); i = i * 2; //控制每次步长,2,4,8……这样 int count = 0; for (int j = 0; j < n; j++) { if (numa[j] == b[j]) { count++; } } if (count == n)//比较相同元素的个数,如果全部相同 { if (i <= n) { cout << "Merge Sort" << endl; Merge(numa, i, n, num0); for (int i = 0; i < n; i++) { if (i) cout << " " << numa[i]; else { cout << numa[i]; } } break; } else if (i>n) { int start = 0;//这里是为了处理最后的单个数据的融合 int end = n - 1; int mid = i / 2 - 1; MergeArray(numa, start, mid, end, num0); cout << "Merge Sort" << endl; for (int i = 0; i < n; i++) { if (i) cout << " " << numa[i]; else { cout << numa[i]; } } break; } } if (i > 2 * n) break; } } return 0; }