提出 #63492432

---

ソースコード 拡げる

#include <bits/stdc++.h>
// #pragma GCC optimize(3)
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define F first
#define S second
#define endl '\n'
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

using namespace std;
using ll = long long;
using i128 = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const ll Inf = 1e18;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;

void solve(){
    int n; cin >> n;
    vector<int> a(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=1; i+2<=n; i++){
        if(a[i] == a[i+1] && a[i+1] == a[i+2]){
            cout << "Yes\n";
            return;
        }
    }
    cout << "No\n";
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); 
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果