219462026-01-14 11:03:04bombinigusiniSípálya (55 pont)cpp17Wrong answer 5/5581ms1272 KiB
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n, k;
    cin>>n>>k;
    vector<int> v(n);
    for(int i=0; i<n; i++) cin>>v[i];
    int osszeg=0, minpetak=k*k+1/2+1, maxszam=0, p;
    for(int i=0; i<k; i++)
    {
        osszeg+=v[i]+i;
        if(v[i]+i>maxszam)
        {
            p=i;
            maxszam=v[i]+i;
        };
    }
    minpetak=maxszam*k-osszeg;
    for(int i=1; i<n-k+1; i++)
    {
        maxszam--;
        if(i==p+1)
        {
            maxszam=v[i];
            for(int j=0; j<k; j++)
            {
                if(v[i+j]-k+j>=maxszam)
                {
                    p=i+j;
                    maxszam=v[i+j]+j;
                }
            }
        }
        else if(v[i+k-1]-1>=maxszam)
        {
            maxszam=v[i+k-1]-1;
            p=i+k-1;
        }
        osszeg=osszeg-v[i-1]+v[i+k-1];
        if(k*maxszam-osszeg<minpetak)minpetak=k*maxszam-osszeg;
    }
cout<<minpetak;
return 0;
}
SubtaskSumTestVerdictTimeMemory
base5/55
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Wrong answer0/21ms508 KiB
4Wrong answer0/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/14ms440 KiB
9Wrong answer0/14ms316 KiB
10Wrong answer0/14ms316 KiB
11Wrong answer0/14ms508 KiB
12Wrong answer0/14ms316 KiB
13Accepted1/14ms436 KiB
14Wrong answer0/24ms432 KiB
15Wrong answer0/24ms432 KiB
16Wrong answer0/275ms1152 KiB
17Wrong answer0/274ms1076 KiB
18Wrong answer0/275ms1196 KiB
19Wrong answer0/375ms1076 KiB
20Wrong answer0/275ms1080 KiB
21Wrong answer0/274ms1272 KiB
22Wrong answer0/275ms1192 KiB
23Wrong answer0/275ms1076 KiB
24Wrong answer0/281ms1076 KiB
25Wrong answer0/275ms1076 KiB
26Wrong answer0/275ms1076 KiB
27Wrong answer0/274ms1188 KiB
28Wrong answer0/375ms1076 KiB
29Wrong answer0/375ms1076 KiB
30Wrong answer0/375ms1268 KiB