19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1a:T4b1,#include #include #include using namespace std; void merge_sort(int s, int e); static vector A; static vector tmp; int main() { int n; cin >> n; A = vector(n+1, 0); tmp = vector(n+1, 0); for(int i=0; i < n; i++) { cin >> A[i]; } merge_sort(1, n); for(int x : v) { cout << x << "\n"; } return 0; } void merge_sort(int s, int e) { if(e - s < 1) { return; } int m = s + (e - s) / 2; merge_sort(s, m); merge_sort(m+1, e); for(int i=s; i < e; i++) { tmp[i] = A[i]; } int k = s; int index1 = s; int index2 = m+1; while(index1 <= m && index2 <= e) { if(tmp[index1] > tmp[index2]) { tmp[k] = tmp[index2]; k++; index2++; } else { tmp[k] = tmp[index1]; k++; index1++; } } while(index1 <= m) { tmp[k] = tmp[index1]; k++; index1++; } while(index2 <= e) { tmp[k] = tmp[index2]; k++; index2++; } }

제출 #15572

제출 정보

제출 결과

제출 코드

찾은 반례