Submission #1,428

2022-09-11 11:38:04

cpp11

Accepted 75/75

27ms

4676 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	cin>>n>>k;
	int ossz=0;;
	vector<int>napok(n+1);
	napok[0]=0;
	for(int i=1; i<n+1; i++){
		int a;
		cin>>a;
		ossz+=a;
		napok[i]=ossz;
	}
	int j=0;
	int maxinap=0;
	for(int i=1; i<n+1; i++){
		while(j<=n && napok[j]-napok[i-1]<=k){
			if(j-i+1>maxinap){
				maxinap=j-i+1;
			}
			j++;
		}
	}
	cout<<maxinap;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	1684 KiB
		2	Accepted	0/0	27ms	2556 KiB
		3	Accepted	3/3	2ms	2048 KiB
		4	Accepted	3/3	2ms	2256 KiB
		5	Accepted	3/3	2ms	2324 KiB
		6	Accepted	3/3	2ms	2464 KiB
		7	Accepted	3/3	2ms	2696 KiB
		8	Accepted	4/4	2ms	2948 KiB
		9	Accepted	4/4	2ms	2980 KiB
		10	Accepted	5/5	2ms	3060 KiB
		11	Accepted	5/5	4ms	3100 KiB
		12	Accepted	5/5	4ms	3312 KiB
		13	Accepted	7/7	19ms	4332 KiB
		14	Accepted	7/7	23ms	4396 KiB
		15	Accepted	7/7	26ms	4524 KiB
		16	Accepted	8/8	25ms	4628 KiB
		17	Accepted	8/8	26ms	4676 KiB