摘要：
http://poj.org/problem?id=2421 There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can 阅读全文
posted @ 2018-10-05 16:30
_Zlrrr
阅读(139)
评论(0)
推荐(0)
摘要：
http://poj.org/problem?id=1287 You are assigned to design network connections between certain points in a wide area. You are given a set of points in 阅读全文
posted @ 2018-10-05 14:23
_Zlrrr
阅读(180)
评论(0)
推荐(0)
摘要：
#include using namespace std; const int maxn = 5e5 + 10; int h[maxn], v[maxn], nx[maxn], in[maxn]; int n, m, sz; void add(int a, int b) { v[sz] = b; nx[sz] = h[a]; h[a] = sz; in[b] ++; s... 阅读全文
posted @ 2018-10-05 11:06
_Zlrrr
阅读(120)
评论(0)
推荐(0)
摘要：
http://poj.org/problem?id=1251 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads 阅读全文
posted @ 2018-10-05 10:40
_Zlrrr
阅读(133)
评论(0)
推荐(0)
浙公网安备 33010602011771号