Pagini recente » Cod sursa (job #2387318) | Cod sursa (job #571706) | Cod sursa (job #2977357) | Cod sursa (job #3237243) | Cod sursa (job #2812333)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n, x[100001], dp[100001];
void read()
{
in >> n;
for(int i = 1; i <= n; ++i)
in >> x[i];
}
int best(int k)
{
int b = dp[k+1];
for(int i = k + 1; i <= n; ++i)
if(x[i] > x[k])
b = max(b, dp[i] + 1);
return b;
}
void afis()
{
int sol = 0;
for(int i = 1; i <= n; ++i)
sol = max(sol, dp[i]);
out << sol;
}
int main()
{
read();
dp[n] = 1;
for(int i = n-1; i > 0; --i)
dp[i] = best(i);
afis();
return 0;
}