77022024-01-10 13:52:42tamasmarkSípálya (55 pont)cpp17Wrong answer 0/55104ms18548 KiB
// sipalya'.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <deque>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

int main()
{
    long long n, k;
    cin >> n >> k;
    vector<pair<long long,long long>>x(n + 1);
    priority_queue<pair<long long, long long>>p,p2;
    long long s1,s2,s3,mini=LONG_MAX,kulombseg;
    for (int i = 1; i <= n; ++i)
    {
        cin >> x[i].first;

        x[i].second = x[i - 1].second + x[i].first;
        p.push({ x[i].first,i });
        while (!p.empty() && p.top().second <= i - k)
        {
            p.pop();
        }
        if (p.top().first-x[i].first<i-p.top().first)
        {
            p2.push({ x[i].first,i });
            while (!p2.empty() && p2.top().second <= i - k)
            {
                p2.pop();
            }
        }
        if (i >= k)
        {
            x[i].second -= x[i - k].second;
            s1 = (p.top().second - (i - k + 1)) + p.top().first;
            if(!p2.empty()) s2 = p.top().first - ((p2.top().second-1) - p.top().second);
            else s2 = p.top().first - (i - p.top().second);
            if (!p2.empty())
            {
                kulombseg = p2.top().first - (p.top().first - ((i-1) - p.top().second))+1;
                s2 = p2.top().first - (i - p2.top().second);
                s1 += kulombseg;
                s3 = (((s1 + s2) * k) / 2)-x[i].second;
            }
            else s3 = (((s1 + s2)*k)/2)-x[i].second;
            mini = min(mini, s1);
        }
    }
    cout << mini;
    return 0;
}
/*
5 3
5 5 6 3 1
*/
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file
SubtaskSumTestVerdictTimeMemory
base0/55
1Wrong answer0/03ms1680 KiB
2Wrong answer0/03ms1932 KiB
3Wrong answer0/23ms2232 KiB
4Wrong answer0/23ms2204 KiB
5Wrong answer0/23ms2536 KiB
6Wrong answer0/23ms2552 KiB
7Wrong answer0/33ms2544 KiB
8Wrong answer0/17ms3740 KiB
9Wrong answer0/17ms3968 KiB
10Wrong answer0/17ms3912 KiB
11Wrong answer0/17ms3548 KiB
12Wrong answer0/17ms3792 KiB
13Wrong answer0/17ms3852 KiB
14Wrong answer0/27ms3852 KiB
15Wrong answer0/27ms3660 KiB
16Wrong answer0/297ms13444 KiB
17Wrong answer0/292ms17852 KiB
18Wrong answer0/290ms18060 KiB
19Wrong answer0/393ms18000 KiB
20Wrong answer0/293ms18004 KiB
21Wrong answer0/296ms18152 KiB
22Wrong answer0/297ms18004 KiB
23Wrong answer0/297ms18008 KiB
24Wrong answer0/2104ms18004 KiB
25Wrong answer0/293ms18000 KiB
26Wrong answer0/293ms18060 KiB
27Wrong answer0/290ms18256 KiB
28Wrong answer0/390ms18220 KiB
29Wrong answer0/390ms18344 KiB
30Wrong answer0/390ms18548 KiB