Pagini recente » Cod sursa (job #2018277) | Cod sursa (job #1382044) | Cod sursa (job #3275061) | Cod sursa (job #884052) | Cod sursa (job #1236476)
#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <utility>
using namespace std;
#define LIM 100005
int dp[LIM];
int main() {
freopen("scmax.in", "r", stdin);
freopen("scmax.out","w", stdout);
int n, a[LIM];
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
dp[i] = 1;
}
for(int i = 0; i < n; i++) {
int mx = 0;
for(int j = 0; j < i; j++) {
if(a[j] < a[i] && dp[j] > mx) {
mx = dp[j];
}
}
dp[i] = max(dp[i], 1 + mx);
}
cout << dp[n - 1] << "\n";
return 0;
}