随笔分类 - 树结构
摘要:Balancing Act #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <ss
阅读全文
摘要:How far away ? #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <s
阅读全文
摘要:C. Uncle Bogdan and Country Happiness #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #in
阅读全文
摘要:1244D - Paint the Tree #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #in
阅读全文
摘要:You are given a tree consisting of nn vertices. A tree is a connected undirected graph with n−1n−1 edges. Each vertex vv of this tree has a color assi
阅读全文
摘要:You have unweighted tree of nn vertices. You have to assign a positive weight to each edge so that the following condition would hold: For every two d
阅读全文
摘要:Writing light novels is the most important thing in Linova's life. Last night, Linova dreamed about a fantastic kingdom. She began to write a light no
阅读全文
摘要:#include "stdafx.h" #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #inclu
阅读全文
摘要:#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ
阅读全文

浙公网安备 33010602011771号