Submission #7,079

2023-12-29 21:30:07

cpp17

Wrong answer 69/75

29ms

4984 KiB

// Source: https://usaco.guide/general/io

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

int main() {
	int n, k;
	cin>>n>>k;
	vector<int> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	int legnagyobb=0;
	int valasz=0;
	int eleje=0, vege=0;
	legnagyobb+=a[0];
	for(;vege<n;){
		if(legnagyobb>k){
			eleje++;
			legnagyobb-=a[eleje-1];
			vege=max(vege, eleje);
		}else{
			valasz=max(valasz, vege-eleje+1);
			vege++;
			if(vege>=n){
				break;
			}
			legnagyobb+=a[vege];
		}
	}
	cout<<valasz<<'\n';
}

	Sum	Test	Verdict		Time	Memory
base	69/75
		1	Accepted	0/0	3ms	1968 KiB
		2	Accepted	0/0	28ms	2724 KiB
		3	Wrong answer	0/3	3ms	2216 KiB
		4	Accepted	3/3	3ms	2428 KiB
		5	Accepted	3/3	3ms	2640 KiB
		6	Accepted	3/3	3ms	2896 KiB
		7	Wrong answer	0/3	3ms	3100 KiB
		8	Accepted	4/4	3ms	3316 KiB
		9	Accepted	4/4	3ms	3560 KiB
		10	Accepted	5/5	3ms	3564 KiB
		11	Accepted	5/5	4ms	3868 KiB
		12	Accepted	5/5	4ms	4056 KiB
		13	Accepted	7/7	20ms	4684 KiB
		14	Accepted	7/7	25ms	4744 KiB
		15	Accepted	7/7	28ms	4760 KiB
		16	Accepted	8/8	28ms	4984 KiB
		17	Accepted	8/8	29ms	4948 KiB