Description: Title Description
There is a legend of the honey series especially sweet, so sweet strong slag seniors love this series...
The definition of honey sequences are as follows: for a length sequence of A1, N, an,... If the sequence of the N prefix and all non negative, i.e. a1> 0, a1+a2> 0,..., a1+a2+...+an> 0, said a sequence is a sequence of honey...
Obviously some honey honey sequence can be divided into more sequences, such as the 12 series of honey can be divided into 1 and 2 two honey series, now has a length of honey sequence n, ask you to put him into several consecutive segments, each segment is a sequence of honey, ask most can be divided into many segments?
input
Many groups of cases, each case first enter an integer n indicating honey sequence length are given, then input n integers A1, A2,..., an said that the sequence of n elements, the tail end of the input file
output
For each case, output one integer per line, said the most sequence can be divided into how
To Search:
File list (Check if you may need any files):
铚滄眮搴忓垪.cpp
Download