http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=578&sca=99&sfl=wr_hit&stx=1295 JUNGOL www.jungol.co.kr #include int N, A[50010], T; int BinSrch(int s, int e, int val) { int m = (s + e) / 2; //printf("[val=%d] s: %d, m: %d, e: %d\n", val, s, m, e); if (A[m] == val) return m; else if (s >= e) return 0; else if (A[m] > val)return BinSrch(s, m, val); elsereturn BinSrch(m + 1, e, val); } i..