208382026-01-09 18:06:07ZsoltSíkság (55)cpp17Wrong answer 0/5548ms3184 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int>v(n);
    for(int i=0; i<n; i++)
    {
        cin>>v[i];
    }
    multiset<int>s{v[0]};
    int mh=0,h=1,mb=0,b=0;
    for(int i=1; i<n; i++)
    {
        s.insert(v[i]);
        if(*s.rbegin()-*s.begin()<=1)
        {
            h++;
        }
        else
        {
            if(mh<h)
            {
                mh=h;
                mb=b;
            }
            while(*s.rbegin()-*s.begin()>1)
            {
                s.erase(v[b]);
                b++;
            }
        }
    }
    if(mh<h)
    {
        mh=h;
        mb=b;
    }
    cout<<mb<<" "<<mh;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/55
1Accepted0/01ms316 KiB
2Wrong answer0/04ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/31ms508 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/34ms316 KiB
11Wrong answer0/34ms508 KiB
12Wrong answer0/34ms820 KiB
13Wrong answer0/339ms564 KiB
14Wrong answer0/337ms3184 KiB
15Wrong answer0/341ms2100 KiB
16Wrong answer0/346ms1056 KiB
17Wrong answer0/348ms1836 KiB
18Wrong answer0/346ms1588 KiB
19Wrong answer0/348ms1844 KiB
20Wrong answer0/348ms1588 KiB
21Wrong answer0/324ms1076 KiB
22Wrong answer0/339ms1844 KiB