Pagini recente » Cod sursa (job #2541531) | Cod sursa (job #361282) | Cod sursa (job #2019486) | Cod sursa (job #1269432) | Cod sursa (job #1236483)
#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++) {
for(int j = i + 1; j < n; j++) {
if(a[j] > a[i])
dp[j] = max(dp[j], dp[i] + 1);
else {
dp[j] = max(dp[j], dp[i]);
}
}
}
int mx = -1;
for(int i = 0; i < n; i++)
mx = max(mx, dp[i]);
cout << mx << "\n";
return 0;
}