136762025-01-08 12:33:44nkbalintSíkság (55)cpp17Time limit exceeded 25/55300ms724 KiB
#include <iostream>

using namespace std;

int n, i, v[100001], db, kezd, veg, k, y, j, maxi, maxi1, kezd1;

int main()
{
    cin >> n;
    for (i = 1;i <= n;++i)
    {
        cin >> v[i];
    }
    for (i = 1;i <= n;++i)
    {
        k = 2;
        y = 0;
        j = i;
        kezd1 = 0;
        maxi1 = 0;
        while (y == 0)
        {
            ++j;
            if (v[i] - v[j] != 0)
            {
                if (k == 2)
                {
                    if (v[i] - v[j] == 1 || v[i] - v[j] == -1) k = v[i] - v[j];
                    else y = 1;
                }
                else if (v[i] - v[j] != k) y = 1;
            }
            if (y == 0)
            {
                kezd1 = i;
                maxi1 = j - i + 1;
            }
            else
            {
                kezd1 = i;
                maxi1 = j - i;
            }
            if (j == n) y = 1;
            
        }
        if (maxi1 > maxi)
        {
            kezd = kezd1;
            maxi = maxi1;
        }
    }
    cout << maxi << " " << kezd;
}
SubtaskSumTestVerdictTimeMemory
base25/55
1Accepted0/01ms316 KiB
2Accepted0/021ms444 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms512 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms500 KiB
8Accepted2/22ms316 KiB
9Accepted3/31ms508 KiB
10Accepted3/314ms444 KiB
11Accepted3/33ms316 KiB
12Time limit exceeded0/3257ms444 KiB
13Accepted3/332ms556 KiB
14Time limit exceeded0/3300ms568 KiB
15Time limit exceeded0/3300ms564 KiB
16Time limit exceeded0/3289ms564 KiB
17Time limit exceeded0/3286ms600 KiB
18Time limit exceeded0/3280ms724 KiB
19Time limit exceeded0/3300ms564 KiB
20Time limit exceeded0/3300ms572 KiB
21Time limit exceeded0/3286ms564 KiB
22Time limit exceeded0/3280ms588 KiB