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

    cout<<maxs<<" "<<k;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/55
1Wrong answer0/01ms320 KiB
2Wrong answer0/04ms320 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms332 KiB
5Accepted2/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/31ms384 KiB
8Wrong answer0/21ms320 KiB
9Wrong answer0/31ms320 KiB
10Wrong answer0/33ms360 KiB
11Wrong answer0/33ms320 KiB
12Wrong answer0/33ms528 KiB
13Wrong answer0/328ms660 KiB
14Wrong answer0/317ms560 KiB
15Wrong answer0/324ms568 KiB
16Wrong answer0/330ms716 KiB
17Wrong answer0/332ms568 KiB
18Wrong answer0/332ms600 KiB
19Wrong answer0/332ms668 KiB
20Wrong answer0/330ms728 KiB
21Wrong answer0/316ms568 KiB
22Wrong answer0/325ms568 KiB