CF846A.Curriculum Vitae
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Hideo Kojima has just quit his job at Konami. Now he is going to find a new place to work. Despite being such a well-known person, he still needs a CV to apply for a job.
During all his career Hideo has produced n games. Some of them were successful, some were not. Hideo wants to remove several of them (possibly zero) from his CV to make a better impression on employers. As a result there should be no unsuccessful game which comes right after successful one in his CV.
More formally, you are given an array s1,s2,...,sn of zeros and ones. Zero corresponds to an unsuccessful game, one — to a successful one. Games are given in order they were produced, and Hideo can't swap these values. He should remove some elements from this array in such a way that no zero comes right after one.
Besides that, Hideo still wants to mention as much games in his CV as possible. Help this genius of a man determine the maximum number of games he can leave in his CV.
输入格式
The first line contains one integer number n ( 1<=n<=100 ).
The second line contains n space-separated integer numbers s1,s2,...,sn ( 0<=si<=1 ). 0 corresponds to an unsuccessful game, 1 — to a successful one.
输出格式
Print one integer — the maximum number of games Hideo can leave in his CV so that no unsuccessful game comes after a successful one.
输入输出样例
输入#1
4 1 1 0 1
输出#1
3
输入#2
6 0 1 0 0 1 0
输出#2
4
输入#3
1 0
输出#3
1