Codeforces 903C - Boxes Packing 推

每个上升序列最后可以看成一个

所以答案就是每个数的个数的最大值

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6, maxd = 1000 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

map<int , int> mp;

int main() {
    kuaidian;

    int n;

    cin >> n;

    int ans = 0;
    for(int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        mp[x]++;
        ans = max(ans, mp[x]);
    }
    cout << ans << endl;


    return 0;
}