摘要：
You want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is ta 阅读全文
posted @ 2016-07-31 15:03
wust_ouyangli
阅读(167)
评论(0)
推荐(0)
摘要：
解析: 裸的有向图最小生成树 代码 #include<cstdio> #include<cstring> #include<string> #include<iostream> #include<sstream> #include<algorithm> #include<utility> #incl 阅读全文
posted @ 2016-07-31 14:53
wust_ouyangli
阅读(295)
评论(0)
推荐(0)
摘要：
In the war, the intelligence about the enemy is very important. Now, our troop has mastered the situation of the enemy's war zones, and known that the 阅读全文
posted @ 2016-07-31 14:47
wust_ouyangli
阅读(221)
评论(0)
推荐(0)
摘要：
After a day, ALPCs finally complete their ultimate intelligence system, the purpose of it is of course for ACM ... ... Now, kzc_tc, the head of the In 阅读全文
posted @ 2016-07-31 10:34
wust_ouyangli
阅读(447)
评论(0)
推荐(0)
摘要：
代码 #include<cstdio> #include<cstring> #include<algorithm> #include<stack> #include<vector> using namespace std; const int maxn=10005; vector<int> G[ma 阅读全文
posted @ 2016-07-31 10:14
wust_ouyangli
阅读(112)
评论(0)
推荐(0)
摘要：
You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a ne 阅读全文
posted @ 2016-07-31 09:26
wust_ouyangli
阅读(135)
评论(0)
推荐(0)
摘要：
You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with 阅读全文
posted @ 2016-07-31 09:11
wust_ouyangli
阅读(215)
评论(0)
推荐(0)
摘要：
You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instructi 阅读全文
posted @ 2016-07-31 08:57
wust_ouyangli
阅读(220)
评论(0)
推荐(0)
浙公网安备 33010602011771号