Pagini recente » Cod sursa (job #2479064) | Cod sursa (job #2901436) | Cod sursa (job #2485326) | Cod sursa (job #1003098) | Cod sursa (job #1854238)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX = 100000 + 5;
int n;
int v[NMAX];
int dp[NMAX];
bool viz[NMAX];
void Read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
}
int main()
{
int maxx;
Read();
dp[n] = 1;
for (int i = n - 1; i >= 1; --i)
{
maxx=0;
// ++dp[i];
for(int j = i + 1; j <= n; ++j)
{
if (v[i] < v[j])
{
maxx = max(maxx, dp[j]);
}
}
dp[i] = maxx + 1;
}
maxx = dp[1];
for(int i = 2; i <= n ; ++i)
maxx=max(maxx, dp[i]);
fout << maxx;
return 0;
}