231442026-01-16 13:53:12sklausSíkság (55)cpp17Wrong answer 53/5532ms788 KiB
#include <iostream>
using namespace std;
int main()
{
    int n;cin>>n;
    int t[n];
    cin>>t[0];
    int a=t[0], sik=1, b=-1, c=0, maxi=0, p=0;
    for(int i=1; i<n; i++)
    {
        cin>>t[i];
        if(abs(t[i]-t[i-1])<=1){
            if(t[i]==t[i-1]){
                sik++;
                c++;
            }
            else{
                if(b==-1 or b==t[i] or a==t[i]){
                if(b==-1 and a!=t[i])
                {
                    b=t[i];
                }
                sik++;
                }
                else{
                    b=t[i];
                    a=t[i-1];
                    sik=c+2;
                }
                c=0;
            }
        }
        else{
            sik=1;
            a=t[i];
            b=-1;
            c=1;
        }
        if(sik>maxi){maxi=sik;p=i;}
    }
    cout<<maxi<<" "<<p-maxi+2;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base53/55
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Accepted2/21ms500 KiB
7Accepted3/31ms316 KiB
8Accepted2/21ms536 KiB
9Accepted3/32ms552 KiB
10Accepted3/34ms432 KiB
11Accepted3/34ms508 KiB
12Accepted3/34ms488 KiB
13Accepted3/330ms700 KiB
14Accepted3/317ms564 KiB
15Accepted3/325ms624 KiB
16Accepted3/332ms788 KiB
17Accepted3/332ms576 KiB
18Accepted3/332ms736 KiB
19Accepted3/332ms616 KiB
20Accepted3/332ms752 KiB
21Accepted3/317ms580 KiB
22Accepted3/326ms644 KiB