128052024-12-31 14:44:54MrkzSíkság (55)cpp17Wrong answer 0/5532ms788 KiB
#include <iostream>
#include <cmath>
using namespace std;
int n,m[100000],maxs,maxj,k,kj;
int main()
{
    cin>>n;
    k=1;
    maxj++;
    for(int i=1;i<=n;i++){
        cin>>m[i];
    }
    for(int i=2;i<=n;i++){
        if((m[i-1]-m[i])*(m[i-1]-m[i])<=1){
            maxj++;
        }
        else{
            if(maxs<maxj){
                maxs=maxj;
                k=kj;
            }
            maxj=0;
            kj=i;
        }
    }

    cout<<k<<" "<<maxs;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/55
1Accepted0/01ms320 KiB
2Wrong answer0/03ms320 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/21ms320 KiB
6Wrong answer0/21ms552 KiB
7Wrong answer0/31ms360 KiB
8Wrong answer0/21ms396 KiB
9Wrong answer0/31ms320 KiB
10Wrong answer0/33ms320 KiB
11Wrong answer0/33ms320 KiB
12Wrong answer0/33ms320 KiB
13Wrong answer0/328ms584 KiB
14Wrong answer0/317ms568 KiB
15Wrong answer0/324ms728 KiB
16Wrong answer0/330ms788 KiB
17Wrong answer0/332ms564 KiB
18Wrong answer0/332ms568 KiB
19Wrong answer0/332ms660 KiB
20Wrong answer0/330ms680 KiB
21Wrong answer0/316ms748 KiB
22Wrong answer0/326ms704 KiB