205192026-01-07 16:57:45algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms1000 KiB
// UUID: 990c6426-5c8d-48b1-8c49-a05375d0a1a6
#include <bits/stdc++.h>
using namespace std;

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

    int l = 0;
    int cur = 0;
    int mini = INT_MAX;
    for (int r = 0; r < n; r++) {
        cur += f[r];
        while (cur >= p) {
            mini = min(mini, r - l + 1);
            cur -= f[l];
            l++;
        }
    }

    cout << mini;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/030ms580 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms436 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms440 KiB
10Accepted2/24ms432 KiB
11Accepted2/230ms564 KiB
12Accepted2/230ms804 KiB
13Accepted2/230ms800 KiB
14Accepted2/230ms800 KiB
15Accepted2/232ms792 KiB
16Accepted2/230ms1000 KiB
17Accepted2/230ms756 KiB
18Accepted2/232ms564 KiB
19Accepted2/230ms752 KiB
20Accepted2/232ms756 KiB
21Accepted2/230ms564 KiB
22Accepted2/230ms564 KiB
23Accepted2/230ms820 KiB
24Accepted2/230ms564 KiB
25Accepted2/230ms564 KiB
26Accepted2/230ms816 KiB
27Accepted2/230ms824 KiB