176282025-08-22 12:30:43szjBenzinkút üzemeltetés (55)cpp17Wrong answer 18/552ms568 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    //ifstream cin("f.txt");
    long long int n, k, ma = 0, maloc = 0, mad=0, j=0, i;
    cin >> n >> k;
    long long int t[n][3];
    cin >> t[0][0] >> t[0][1];
    t[0][2] = 0;
    for(i=1; i<n; i++)
    {
        cin >> t[i][0] >> t[i][1];
        for(j; t[i][0]-t[j][0] >= k; j++)
            if(t[j][1] > ma)
            {
                ma = t[j][1];
                maloc = j;
                mad = t[j][2];
            }
        t[i][1]+=ma;
        t[i][2] = maloc;
    }
    for(j; j<n; j++)
        if(t[j][1] > ma)
        {
            ma = t[j][1];
            maloc = j;
            mad = t[j][2];
        }
    cout << ma<<endl;
    vector<int>vec;
    while(maloc)
    {
        vec.push_back(maloc+1);
        maloc = t[maloc][2];
    }
    cout << vec.size()<<" ";
    for(i=vec.size()-1; i>=0; i--)cout << vec[i] << " ";

}
SubtaskSumTestVerdictTimeMemory
base18/55
1Accepted0/01ms332 KiB
2Wrong answer0/02ms316 KiB
3Wrong answer0/31ms328 KiB
4Wrong answer0/31ms316 KiB
5Accepted3/31ms512 KiB
6Wrong answer0/31ms500 KiB
7Accepted3/31ms324 KiB
8Wrong answer0/31ms324 KiB
9Wrong answer0/31ms568 KiB
10Wrong answer0/31ms328 KiB
11Wrong answer0/31ms328 KiB
12Wrong answer0/31ms328 KiB
13Wrong answer0/41ms328 KiB
14Wrong answer0/41ms348 KiB
15Wrong answer0/51ms328 KiB
16Accepted6/61ms328 KiB
17Accepted6/61ms328 KiB