228572026-01-15 21:31:25FintaTihamerSíkság (55)cpp17Time limit exceeded 31/55300ms768 KiB
#include <iostream>
#include <fstream>
using namespace std;
struct Volgy{
    int k,v;
    int h;
};
int main()
{   int n;
    fstream f("be.in");
    cin>>n;
    int a[100000];
    for(int i=0; i<n; i++){cin>>a[i];}
    Volgy o;
    o.k=0;
    o.v=0;
    o.h=1;
    for(int i=0; i<n-1; i++){
            int s=i;
            int lg=a[i];
            int lk=a[i];
            while(s<n){
                if(lg<a[s]) lg=a[s];
                if(lk>a[s]) lk=a[s];
                if(lg-lk>1) break;
                s++;
            }
            int p=s-i+1;
            if(o.h<p){
                o.k=i;
                o.v=s-1;
                o.h=p;
            }
    }
    cout<<o.h-1<<" "<<o.k+1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base31/55
1Accepted0/01ms316 KiB
2Accepted0/012ms316 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms320 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/21ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/310ms316 KiB
11Accepted3/33ms316 KiB
12Accepted3/371ms444 KiB
13Accepted3/330ms564 KiB
14Time limit exceeded0/3298ms768 KiB
15Time limit exceeded0/3300ms744 KiB
16Time limit exceeded0/3300ms700 KiB
17Time limit exceeded0/3275ms564 KiB
18Time limit exceeded0/3277ms720 KiB
19Time limit exceeded0/3300ms564 KiB
20Time limit exceeded0/3300ms564 KiB
21Accepted3/3112ms564 KiB
22Time limit exceeded0/3280ms564 KiB