Submission #73503789

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    vector<pll> b(n);
    rep(i, 0, n){
        cin >> a[i];
        b[i].first = a[i];
        b[i].second = i;
    }
    sort(all(b));
    ll ans = 1;
    for(auto [x, p] : b){
        ll z = x+1;
        ll er = 1;
        rep(i, p+1, n){
            if(a[i] == z){
                er++;
                z++;
            }
        }
        ans = max(ans, er);
    }
    cout << ans << el;
    return 0;
}

int main() {
    int t = 1;
    // cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result