才疏学浅易大师的博客

Given a sequence of K integers { N 1, N 2, …, N K}. A continuous subsequence is defined to be { N i, N i+1, …, N j} where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes