228552026-01-15 21:30:19FintaTihamerSíkság (55)cpp17Wrong answer 29/55300ms800 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++){
        if(a[i]-a[i+1] == 1 || a[i]-a[i+1] == -1 || a[i]==a[i+1]){
            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
base29/55
1Accepted0/01ms556 KiB
2Accepted0/013ms440 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted2/22ms316 KiB
9Accepted3/32ms508 KiB
10Accepted3/313ms600 KiB
11Accepted3/34ms500 KiB
12Accepted3/382ms528 KiB
13Accepted3/334ms672 KiB
14Time limit exceeded0/3298ms580 KiB
15Time limit exceeded0/3300ms568 KiB
16Time limit exceeded0/3287ms564 KiB
17Time limit exceeded0/3280ms564 KiB
18Time limit exceeded0/3280ms564 KiB
19Time limit exceeded0/3300ms564 KiB
20Time limit exceeded0/3300ms732 KiB
21Accepted3/3127ms800 KiB
22Time limit exceeded0/3280ms564 KiB