198362025-12-25 10:55:57KristófSípálya (55 pont)cpp17Wrong answer 2/55118ms8104 KiB
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;

int main()
{
    int n;
    long long k;
    cin>>n>>k;
    vector<int> nums(n);
    multiset<int> maxk;
    map<int,int> lastseen;
    for(int & x:nums)cin>>x;
    int j=0;
    long long sum=0;
    int i=0;
    for(;i<k;i++)
        {
        maxk.insert(nums[i]+i);
        sum+=nums[i];
        }
    long long sv=*maxk.rbegin()-j;

    long long ans=(sv+sv-k+1)/2*k-sum;
    //cout<<ans;
    while(i<n)
        {
        maxk.erase(maxk.find(nums[j]+j));
        maxk.insert(nums[i]+i);
        sum-=nums[j];
        j++;
        sum+=nums[i];
        sv=*maxk.rbegin()-j;
        ans=min(ans,(sv+sv-k+1)/2*k-sum);
        //cout<<i<<" "<<j<<"\n";
        i++;
        }
    cout<<ans;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/55
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms508 KiB
4Wrong answer0/22ms508 KiB
5Wrong answer0/22ms400 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/32ms404 KiB
8Wrong answer0/16ms456 KiB
9Wrong answer0/16ms396 KiB
10Wrong answer0/17ms464 KiB
11Wrong answer0/17ms368 KiB
12Wrong answer0/16ms316 KiB
13Wrong answer0/16ms440 KiB
14Wrong answer0/26ms624 KiB
15Wrong answer0/26ms432 KiB
16Wrong answer0/2115ms1460 KiB
17Wrong answer0/2115ms5800 KiB
18Wrong answer0/2118ms6320 KiB
19Wrong answer0/3116ms8104 KiB
20Wrong answer0/2114ms1964 KiB
21Wrong answer0/2111ms1712 KiB
22Wrong answer0/2111ms1708 KiB
23Wrong answer0/2112ms1448 KiB
24Wrong answer0/2115ms1588 KiB
25Wrong answer0/2115ms1964 KiB
26Wrong answer0/2115ms2356 KiB
27Wrong answer0/2112ms2480 KiB
28Wrong answer0/3112ms2492 KiB
29Wrong answer0/3114ms2612 KiB
30Wrong answer0/3115ms2868 KiB