Submission #9,269

2024-02-19 16:36:02

cpp17

Accepted 50/50

30ms

4776 KiB

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

int main(){
    int n, p;
    cin >> n >> p;
    int fiz[n];
    for (int i=0;i<n;i++){cin >> fiz[i];}
    int i=0, j=0;
    int ossz=0;
    int db=1000001;
    while (i<=n and j<=n){
        if(ossz>=p){db=min(db,j-i);ossz-=fiz[i];i++;}
        else{ossz+=fiz[j];j++;}
    }
    cout << db;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1872 KiB
		2	Accepted	0/0	30ms	2896 KiB
		3	Accepted	2/2	3ms	2360 KiB
		4	Accepted	2/2	3ms	2568 KiB
		5	Accepted	2/2	3ms	2604 KiB
		6	Accepted	2/2	4ms	2716 KiB
		7	Accepted	2/2	4ms	2864 KiB
		8	Accepted	2/2	6ms	2944 KiB
		9	Accepted	2/2	4ms	3032 KiB
		10	Accepted	2/2	4ms	3156 KiB
		11	Accepted	2/2	30ms	3984 KiB
		12	Accepted	2/2	30ms	4092 KiB
		13	Accepted	2/2	30ms	4012 KiB
		14	Accepted	2/2	30ms	4088 KiB
		15	Accepted	2/2	30ms	4088 KiB
		16	Accepted	2/2	30ms	4092 KiB
		17	Accepted	2/2	30ms	4088 KiB
		18	Accepted	2/2	30ms	4216 KiB
		19	Accepted	2/2	30ms	4304 KiB
		20	Accepted	2/2	30ms	4548 KiB
		21	Accepted	2/2	30ms	4516 KiB
		22	Accepted	2/2	30ms	4516 KiB
		23	Accepted	2/2	30ms	4640 KiB
		24	Accepted	2/2	30ms	4756 KiB
		25	Accepted	2/2	30ms	4760 KiB
		26	Accepted	2/2	30ms	4776 KiB
		27	Accepted	2/2	30ms	4760 KiB