← 返回题目
题库练习 [COCI-2010_2011-contest5]#2 DVONIZ
← 上一题 下一题 →

A1210 | [COCI-2010_2011-contest5]#2 DVONIZ

来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

We say that a sequence of 2*K elements is interesting if neither the sum of the first K elements, nor the sum of the last K elements, is greater than S.
A sequence A of length N is given. For every element, output the length of the longest interesting subsequence starting with that element.

输入格式

The first line contains integers N and S (2 ≤ N ≤ 100 000, 1 ≤ S ≤ 2*10^9).
The following N lines contain the sequence A, one integer per line. The integers are positive and their sum does not exceed 2*10^
9.

输出格式

Output must consist of N lines. i-th line must contain one integer, the length of the longest interesting subsequence starting with the i-th element. If an interesting subsequence at that position doesn’t exist,
output 0 (zero).

输入输出样例

输入 #1
5 10000 
1 
1 
1 
1 
1
输出 #1
4 
4 
2 
2 
0
输入 #2
5 9 
1 
1 
10 
1 
9
输出 #2
2 
0 
0 
2 
0
输入 #3
8 3 
1 
1 
1 
1 
1 
1 
1 
1
输出 #3
6 
6 
6 
4 
4 
2 
2 
0
C++ 编辑器
输入
输出