Pagini recente » Cod sursa (job #700910) | Cod sursa (job #580589) | Cod sursa (job #540656) | Cod sursa (job #31321) | Cod sursa (job #1619379)
#include <iostream>
#include <stack>
#include <fstream>
#include <vector>
#include <algorithm>
#include <ctime>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int dp[100001], v[100001], i, j, Max=-1, n;
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
dp[i]=1;
in>>v[i];
}
for(i=2;i<=n;i++)
for(j=1;j<=i;j++)
if(v[j]<v[i]) dp[i]= max(dp[j]+1, dp[i]);
for(i=1;i<=n;i++)
Max=max(dp[i],Max);
out<<Max;
return 0;
}