摘要: Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored).Then, FF can choose a continuous subs 阅读全文
posted @ 2013-11-01 17:51 persistent codeants 阅读(240) 评论(0) 推荐(0)
摘要: Problem DescriptionFor a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equation.Given a complete graph of n nodes with all nodes and edges weighted, your task is to find a tree, which is a sub-graph of the original graph, with m nodes and whos 阅读全文
posted @ 2013-11-01 15:44 persistent codeants 阅读(228) 评论(0) 推荐(0)
摘要: Problem DescriptionZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him make a portal in our universal. Unfortunately, making a pair of portals will cost min{T} energies. T in a path between point V and point U is the length of the longest edge 阅读全文
posted @ 2013-11-01 12:05 persistent codeants 阅读(365) 评论(0) 推荐(0)