193962025-12-07 22:59:28KristófLeggyorsabb pénzkeresés (50)cpp17Accepted 50/5032ms1604 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n,szukseg;
    cin>>n>>szukseg;
    vector<int> data(n);
    for(int &x : data)
        {
        cin>>x;
        }
    vector<int> prefix(n+1,0);
    prefix[1]=data[0];
    for(int i=2;i<=n;i++)
        {
        prefix [i] = prefix[i-1]+data[i-1];
        //cout<<prefix[i]<<endl;
        }
    int left,right;
    left=right=1;
    left--;
    int ans=10002;
    while(right<=n)
        {
        //cout<<right <<" "<< left-1<<endl;
        if(prefix[right] - prefix[left] >= szukseg)
            {
            //cout<<right <<" "<< left<<endl;
            if(ans>right-left)
                {
                //cout<<right <<" "<< left<<endl;
                ans=right-left;
                }
            left++;
            }
        else
            {
            right++;
            }
        }
    cout<<ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/029ms1544 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms400 KiB
5Accepted2/21ms316 KiB
6Accepted2/24ms508 KiB
7Accepted2/24ms484 KiB
8Accepted2/24ms480 KiB
9Accepted2/24ms508 KiB
10Accepted2/24ms440 KiB
11Accepted2/229ms1432 KiB
12Accepted2/229ms1056 KiB
13Accepted2/229ms1544 KiB
14Accepted2/229ms1076 KiB
15Accepted2/230ms1572 KiB
16Accepted2/232ms1436 KiB
17Accepted2/229ms1536 KiB
18Accepted2/229ms1456 KiB
19Accepted2/230ms1604 KiB
20Accepted2/229ms964 KiB
21Accepted2/229ms1076 KiB
22Accepted2/230ms1556 KiB
23Accepted2/230ms1436 KiB
24Accepted2/230ms1548 KiB
25Accepted2/229ms1428 KiB
26Accepted2/230ms1588 KiB
27Accepted2/230ms1540 KiB