이진탐색2 [문제풀이] 2512번: 예산 [문제풀이] 2512번: 예산https://www.acmicpc.net/problem/2512 문제유형이진탐색 Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162#include int N;long long M; //총예산int yesan[10010];int max; void inputData(){ scanf("%d", &N); for (register int i = 0; i 2018. 7. 5. [문제풀이] 2776번: 암기왕 [문제풀이] 2776번: 암기왕https://www.acmicpc.net/problem/2776 문제유형이진탐색, 병합정렬 Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677#include int note[1000010];int tmp[1000010]; int binarySearch(int s, int e, int data){ int m; while (s = e) return; m = (s + e) / 2; merge_sort(s, m); merge_sort(m + 1, e); idx.. 2018. 7. 4. 이전 1 다음