153682025-02-19 09:09:43999Leggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms992 KiB
// Source: https://usaco.guide/general/io

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

int main() {
	int n,k;cin>>n>>k;
    vector<int> v(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
    }
    int j=-1,sum=0,ans=INT_MAX;
    for(int i = 0;i<n;i++){
        if(i>j)j=i;
        while(j<n&&sum<k){
            sum+=v[j];
            j++;
        }//cerr<<i<<','<<j<<':'<<sum<<endl;
        if(sum>=k)ans=min(ans,j-i);
        sum-=v[i];
    }cout<<ans<<endl;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/028ms564 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms396 KiB
8Accepted2/23ms316 KiB
9Accepted2/24ms432 KiB
10Accepted2/24ms316 KiB
11Accepted2/228ms820 KiB
12Accepted2/228ms564 KiB
13Accepted2/228ms748 KiB
14Accepted2/228ms800 KiB
15Accepted2/232ms756 KiB
16Accepted2/229ms760 KiB
17Accepted2/228ms564 KiB
18Accepted2/228ms804 KiB
19Accepted2/229ms564 KiB
20Accepted2/228ms564 KiB
21Accepted2/228ms804 KiB
22Accepted2/228ms756 KiB
23Accepted2/229ms564 KiB
24Accepted2/229ms564 KiB
25Accepted2/229ms992 KiB
26Accepted2/229ms564 KiB
27Accepted2/228ms564 KiB