Notice
Recent Posts
Recent Comments
Link
목록코딩테스트/백준 (9)
bdfgdfg
1920번 수 찾기 - 이진탐색(이분탐색)
#include #include #include using namespace std; vector data2; vector serch; vector check; void BinarySerch() { int mid; int left = 0; int right = data2.size() - 1; static int idx = 0; int value = serch[idx]; while (left value) { right = mid - 1; } else { left = mid + 1; } } idx++; } int main(void) { int N,a; cin >> N; data2.reserve(N + 1); serch.reserve(N + 1); check.resize(N + 1); for (int i = ..
코딩테스트/백준
2021. 9. 8. 14:35