208392026-01-09 18:11:23AsuraSíkság (55)cpp17Accepted 55/5550ms2664 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,ah=1,mb=0, b=0;
    for(int i=1; i<n; i++){
        s.insert(v[i]);
        if(*s.rbegin()-*s.begin()<=1){
            ah++;
        }else{
            if(mh<ah){
                mh=ah;
                mb=b;
            }
            while(*s.rbegin()-*s.begin()>1){
                s.erase(s.find(v[b]));
                b++;
            }
            ah=s.size();
        }
    }
    if(mh<ah){
        mh=ah;
        mb=b;
    }
    cout<<mh<<" "<<mb+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/01ms528 KiB
2Accepted0/04ms484 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms508 KiB
8Accepted2/21ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/36ms316 KiB
11Accepted3/34ms316 KiB
12Accepted3/34ms696 KiB
13Accepted3/339ms796 KiB
14Accepted3/339ms2664 KiB
15Accepted3/343ms1836 KiB
16Accepted3/346ms1056 KiB
17Accepted3/350ms1824 KiB
18Accepted3/346ms1568 KiB
19Accepted3/348ms1832 KiB
20Accepted3/348ms1580 KiB
21Accepted3/323ms1076 KiB
22Accepted3/341ms1736 KiB