Description: One side of the street there are several houses. Because of environmental reasons people want to plant some trees on the roadside, roadside area is divided into blocks, and was number into 1 .. N, each part of a unit size and up to plant a tree, each resident want to plant some trees in front and specifies three numbers B, E, T, which means that residents want three numbers in between B and E at least kind of T tree. Of course, B ≤ E, residents must remember that in the designated area can not grow more than the number of tree plots area, so T ≤ E-B+l. Residents who want to plant trees in their respective regions can overlap. Your task is to find the minimum required to meet all of the number of trees.
To Search:
File list (Check if you may need any files):
Trees.txt
Download