# [codeforces754D] Fedor and coupons

## 题目大意

$N$个线段，从中选$k$个线段，使得交集最大。

# codeforces #389 Div.2

http://codeforces.com/contest/752

# [UER #7] 短路

## Description

“第七套广播体操，原地踏步——走！”

# [bzoj 2525][Poi2011] Dynamite

## Description

The Byteotian Cave is composed of  n chambers and n-1 corridors that connect them. For every pair of chambers there is unique way to move from one of them to another without leaving the cave. Dynamite charges are set up in certain chambers. A fuse is laid along every corridor. In every chamber the fuses from the adjacent corridors meet at one point, and are further connected to the dynamite charge if there is one in the chamber. It takes exactly one unit of time for the fuse between two neighbouring chambers to burn, and the dynamite charge explodes in the instant that fire reaches the chamber it is inside.
We would like to light the fuses in some m chambers (at the joints of fuses) in such a way that all the dynamite charges explode in the shortest time possible since the fuses are lit. Write a program that will determine the minimum such time possible.