Submission

Score: 10

User: Bunkoblong

Problemset: กองชาม

Language: cpp

Time: 0.016 second

Submitted On: 2025-10-01 23:58:23

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int N, x;
    cin >> N;
    vector<int> piles;

    while (N--) {
        cin >> x;
        auto it = upper_bound(piles.begin(), piles.end(), x);
        if (it == piles.begin()) piles.insert(piles.begin(), x);
        else *(--it) = x;
    }
    cout << piles.size() << '\n';
}