摘要：
int BiSearch(int len, int w) { int left = 0, right = len - 1; int mid; while (left <= right) { mid = left + (right-left)/2; if (bz[mid] > w) right = m 阅读全文
posted @ 2017-07-18 22:47
Aragaki
阅读(143)
评论(0)
推荐(0)
摘要：
#include <iostream> #include <queue> #include <vector> using namespace std; const int N=405; struct rec { int v,w; }; vector<rec> edge[N*N]; int n,st, 阅读全文
posted @ 2017-07-18 22:41
Aragaki
阅读(256)
评论(2)
推荐(0)
浙公网安备 33010602011771号