252482026-02-18 20:49:29xxxLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms1392 KiB
// Source: https://usaco.guide/general/io

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

signed main() {
	int n, p;
    cin >> n >> p;
    vector<int> a(n+1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    int l, r;
    l = r = 1;
    int sum = a[1];
    int ans = 10000000000;
    while (r <= n) {
        if (sum >= p) {
            ans = min(ans, r-l+1);
            sum-=a[l];
            l++;
        }
        else {
            r++;
            sum += a[r];
        }
    }
    cout << ans << endl;
}
 
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/030ms1076 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms472 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms316 KiB
11Accepted2/232ms1192 KiB
12Accepted2/230ms1200 KiB
13Accepted2/230ms1268 KiB
14Accepted2/230ms1076 KiB
15Accepted2/230ms1268 KiB
16Accepted2/230ms1268 KiB
17Accepted2/230ms1076 KiB
18Accepted2/230ms1196 KiB
19Accepted2/230ms1272 KiB
20Accepted2/230ms1076 KiB
21Accepted2/230ms1076 KiB
22Accepted2/230ms1260 KiB
23Accepted2/230ms1192 KiB
24Accepted2/230ms1196 KiB
25Accepted2/230ms1200 KiB
26Accepted2/230ms1192 KiB
27Accepted2/230ms1392 KiB