Submission #1972018

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

vector<int> left_c;
vector<int> right_c;
vector<int> lenght_c;

int N;
short lights[100000];

int main()
{
    cin >> N;

    for (int i = 0; i < N; i++)
    {
        cin >> lights[i];
    }

    int cou = 1;
    int l = 0;

    int result = 0;

    for (int i = 1; i < N; i++)
    {
        if (lights[i - 1] != lights[i])
        {
            cou++;
        }
        else
        {
            left_c.push_back(lights[l]);
            right_c.push_back(lights[i - 1]);
            lenght_c.push_back(cou);
            result = max(result, cou);
            cou = 1;
            l = i;
        }
    }
    left_c.push_back(lights[l]);
    right_c.push_back(lights[N - 1]);
    lenght_c.push_back(cou);
    result = max(result, cou);
    cou = 1;

    for (int i = 0; i < left_c.size(); i++)
    {
        int len = lenght_c[i];
        if (i > 0)
        {
            if (right_c[i - 1] == left_c[i])
            {
                len += lenght_c[i - 1];
            }
        }
        if (i < left_c.size() - 1)
        {
            if (right_c[i] == left_c[i + 1])
            {
                len += lenght_c[i + 1];
            }
        }

        result = max(result, len);
    }

    cout << result << endl;
    return 0;
}

Submission Info

Judge Result