128222025-01-01 22:02:05ercseferencSípálya (55 pont)cpp17Wrong answer 18/55500ms1344 KiB
#include <iostream>
using namespace std;
int main()
{
    int n,k,p,ar; cin>>n>>k;
    int a[n],b[n-k+1]; for(int i=0; i<n; i++){cin>>a[i];}
    for(int i=k-1; i<n; i++){
        p=0; ar=0;
        for(int j=i; j>=i-k+1; j--){
            if(a[j]<p){ar+=p-a[j];}
            else{ar+=(i-j)*(a[j]-p); p=a[j];}
            p++;}
        b[i-k+1]=ar;} p=b[0];
    for(int i=0; i<=n-k; i++){if(b[i]<p)p=b[i];}
    cout<<p;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base18/55
1Accepted0/01ms320 KiB
2Accepted0/01ms320 KiB
3Accepted2/22ms320 KiB
4Accepted2/21ms408 KiB
5Accepted2/21ms344 KiB
6Accepted2/22ms540 KiB
7Wrong answer0/32ms320 KiB
8Accepted1/18ms508 KiB
9Accepted1/19ms320 KiB
10Accepted1/110ms548 KiB
11Accepted1/116ms512 KiB
12Accepted1/114ms320 KiB
13Accepted1/132ms416 KiB
14Accepted2/235ms456 KiB
15Accepted2/216ms444 KiB
16Time limit exceeded0/2500ms1344 KiB
17Time limit exceeded0/2483ms1192 KiB
18Time limit exceeded0/2500ms936 KiB
19Time limit exceeded0/3500ms1176 KiB
20Time limit exceeded0/2481ms1080 KiB
21Time limit exceeded0/2499ms1224 KiB
22Time limit exceeded0/2483ms1036 KiB
23Time limit exceeded0/2483ms1080 KiB
24Time limit exceeded0/2486ms1080 KiB
25Time limit exceeded0/2500ms1080 KiB
26Time limit exceeded0/2500ms996 KiB
27Time limit exceeded0/2500ms996 KiB
28Time limit exceeded0/3481ms1192 KiB
29Time limit exceeded0/3500ms1080 KiB
30Time limit exceeded0/3481ms1080 KiB