244962026-02-12 09:43:46nagynimrod902Leggyorsabb pénzkeresés (50)cpp17Time limit exceeded 36/50300ms1076 KiB
#include <iostream>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n, db, mini=2147483647, j;
    long p, osszeg;
    cin >> n >> p;
    int f[n];
    for(int i=0; i<n; i++) {
        cin >> f[i];
    }
    for(int i=0; i<n; i++) {
        osszeg=0;
        db=0;
        j=i;
        while(osszeg<p && j<n) {
            osszeg+=f[j];
            j++;
            if(osszeg<p && j==n) db=2147483647; else db++; ///Ha a ciklus veget er, de nem talal jo sorozatot, ne vegye figyelembe azt.
        }
        if (mini>db) mini=db;
    }
    cout << mini;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0282ms820 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/27ms456 KiB
7Accepted2/225ms456 KiB
8Accepted2/235ms316 KiB
9Accepted2/27ms316 KiB
10Accepted2/229ms316 KiB
11Accepted2/213ms792 KiB
12Time limit exceeded0/2287ms804 KiB
13Time limit exceeded0/2263ms564 KiB
14Accepted2/281ms704 KiB
15Time limit exceeded0/2259ms1076 KiB
16Accepted2/276ms564 KiB
17Accepted2/267ms564 KiB
18Accepted2/2111ms568 KiB
19Time limit exceeded0/2300ms564 KiB
20Time limit exceeded0/2211ms564 KiB
21Accepted2/2123ms800 KiB
22Accepted2/2177ms1076 KiB
23Time limit exceeded0/2277ms564 KiB
24Accepted2/2171ms808 KiB
25Time limit exceeded0/2224ms812 KiB
26Accepted2/2118ms564 KiB
27Accepted2/2115ms568 KiB