Submission #33486

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <sstream>

using namespace std;

int main() {
    int inf = 100000000;
    int n;
    cin >> n;
    vector<int> w(n), hoge(n, inf);
    for (int i=0; i<n; i++) {
        cin >> w[i];
    }
    
    for (int i=0; i<n; i++) {
        sort(hoge.begin(), hoge.end());
        for (int j=0; j<n; j++) {
            if (hoge[j] >= w[i]) {
                hoge[j] = w[i];
                break;
            }
        }
    }

    int res = 0;
    
    for (int i=0; i<n; i++) {
        if (hoge[i] != inf)res++;
    }
    cout << res << endl;
}

Submission Info

Judge Result