Submission #73485920

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<ll, ll>m;
ll arr[200001];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    ll n;
    cin >> n;
    for(ll i = 1; i<=n; i++){
        ll a;
        cin >> a;
        arr[i] = a;
    }
    for(ll i = 1; i<=n; i++){
        ll t = arr[i];
        if(m.find(t) == m.end())m.insert({t, 1});
        if(m.find(t-1) == m.end())continue;
        m[t] = max(m[t], m[t-1] + 1);
        //cout << t << ' ' << m[t] << '\n';
    }
    ll ma = 0;
    for(auto a : m){
        //cout << a.first << a.second << '\n';
        ma = max(a.second, ma);
    }
    cout << ma;
    return 0;

}   

Submission Info

Judge Result