DDoS

题意翻译

# 题目描述 现在有越来越多的关于DDoS攻击网站的新闻。 Arseny是一个管理员,他认为如果一段时间内请求的总数超过100*t,那么网站就会受到DDoS攻击,其中t是时间段的秒数。 Arseny知道从服务器启动以来每秒请求次数的统计数据。他知道序列R1、R2、R3 …… Rn,其中Ri是启动后第i秒的请求数。 确定Arseny认为是DDoS攻击的最长连续时间段的长度。查找时间在1~n以内。 # 输入格式 第一行包含N(1 <= n <= 5000),表示服务器启动后的秒数。第二行包含整数序列R1、R2、R3 …… Rn(0<=Ri<=5000)。 # 输出格式 输出只有一个数字:被认为是DDoS攻击的最长的时间段的长度。如果它不存在,输出“0” (不含引号)。

题目描述

We get more and more news about DDoS-attacks of popular websites. Arseny is an admin and he thinks that a website is under a DDoS-attack if the total number of requests for a some period of time exceeds $ 100 \cdot t $ , where $ t $ — the number of seconds in this time segment. Arseny knows statistics on the number of requests per second since the server is booted. He knows the sequence $ r_1, r_2, \dots, r_n $ , where $ r_i $ — the number of requests in the $ i $ -th second after boot. Determine the length of the longest continuous period of time, which Arseny considers to be a DDoS-attack. A seeking time period should not go beyond the boundaries of the segment $ [1, n] $ .

输入输出格式

输入格式


The first line contains $ n $ ( $ 1 \le n \le 5000 $ ) — number of seconds since server has been booted. The second line contains sequence of integers $ r_1, r_2, \dots, r_n $ ( $ 0 \le r_i \le 5000 $ ), $ r_i $ — number of requests in the $ i $ -th second.

输出格式


Print the only integer number — the length of the longest time period which is considered to be a DDoS-attack by Arseny. If it doesn't exist print 0.

输入输出样例

输入样例 #1

5
100 200 1 1 1

输出样例 #1

3

输入样例 #2

5
1 2 3 4 5

输出样例 #2

0

输入样例 #3

2
101 99

输出样例 #3

1