204232026-01-06 18:07:32algoproLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms748 KiB
// UUID: 09d251f8-3d88-4611-aa47-91ace6f3bd4c
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, p;
    cin >> n >> p;
    vector<int> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    int i = 0;
    int j = 0;
    int sum = 0;
    int mini = 1000000000;
    while (i != n){
        if (sum >= p){
            mini = min(mini, j-i);
            sum -= a[i];
            i++;
        } else if(j != n) {
            sum += a[j];
            j++;
        } else i++;
    }
    if (sum >= p)
        mini = min(mini, j-i);
    cout << mini;
    
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/030ms748 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms316 KiB
7Accepted2/24ms316 KiB
8Accepted2/24ms316 KiB
9Accepted2/24ms316 KiB
10Accepted2/24ms436 KiB
11Accepted2/230ms664 KiB
12Accepted2/230ms564 KiB
13Accepted2/230ms564 KiB
14Accepted2/230ms568 KiB
15Accepted2/230ms564 KiB
16Accepted2/230ms564 KiB
17Accepted2/230ms564 KiB
18Accepted2/230ms564 KiB
19Accepted2/230ms748 KiB
20Accepted2/230ms564 KiB
21Accepted2/230ms564 KiB
22Accepted2/230ms564 KiB
23Accepted2/229ms564 KiB
24Accepted2/232ms568 KiB
25Accepted2/230ms564 KiB
26Accepted2/230ms564 KiB
27Accepted2/230ms568 KiB