Submission #34048

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <set>

#define rep2(i, b, n) for(int i=b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
#define sz(v) v.size()
#define mk(x, y) make_pair(x, y)
#define fst first
#define scd second
#define MEMSET(x, n) memset(x, n, sizeof(x))
#define MEMZERO(x) MEMSET(x, 0)
#define URU(y) (!(y % 4) && y % 100 || !(y % 400))

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int main( void ) 
{
	int n, m[50];
	while(cin >> n) {
		fill(m, m+50, -1);
		int size = 1;
		cin >> m[0];
		rep(i, n-1) {
			bool hit = false;
			int w;
			cin >> w;
			rep(j, size) {
				if(m[j] >= w) {
					m[j] = w;
					hit = true;
					break;
				}
			}
			if(!hit) {
				m[size++] = w;
			}
		}
		cout << size << endl;
	}
	return 0;
}

Submission Info

Judge Result