孤风的博客

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6832 博客园食用链接：https://www.cnblogs.com/lonely-wind-/p/13455277.html An undirected connected graph has n nodes and m edges, The i-th edge’s length is 2i2^i2i. Each node i has a value aia_iai​, which is either 0 o

题目链接：https://codeforces.com/problemset/problem/592/D 博客园食用链接： Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that consists of n cities, connected by n - 1 bidirectional

Time Limit:3000MS Memory Limit:65536K Description David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over ...

Slim Span Time Limit: 5000MS Memory Limit: 65536K 题目链接http://poj.org/problem?id=3522 Description Given an undirected weighted graph G, you should find one of spanning trees specified as follows. The ...