Algorithm/이분탐색9 [백준][1939번][이분탐색] 중량제한 중량제한 https://www.acmicpc.net/problem/193912345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273#include #include #include using namespace std; vector bridge[100010];int visit[100010] = {}; bool finalmap(int vertx, int weight,int finalvertx){ bool result = false; if (finalvertx == vertx) return true; for (int i = 0.. 2016. 4. 6. [백준][10816번][이분탐색] 숫자 카드 2 숫자 카드 2 https://www.acmicpc.net/problem/10816 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960#include #include using namespace std;int card[600000];int serch[600000]; int twoserch(int left, int right, int count ,int serchnum){ int mid = (left + right) / 2; int result; if (left > right) return count; else { if (card[mid] > serchnum){.. 2016. 4. 6. [ALGOSPOT][이분탐색] DARPA DARPA https://www.algospot.com/judge/problem/read/DARPA1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556#include int main(void){ int testcase; scanf("%d", &testcase); while (testcase--){ int N, M; int camerMI[210]; double result; scanf("%d %d", &N, &M); for (int i = 0; i 2016. 4. 5. 이전 1 2 다음 728x90
