Pagini recente » Istoria paginii runda/wellcodesimulareclasa10-13martie | Cod sursa (job #1836501) | Cod sursa (job #2958771) | Istoria paginii runda/wellcodesimulareclasa10-11martie | Cod sursa (job #1734100)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n;
int vector[100005];
void pd()
{
int best[100005];
int maxim = 0;
int result = 0;
best[0] = 1;
for (int i = 1; i < n; i++)
{
for (int j = i; j > 0; j--)
{
if (best[j] > maxim && vector[i] > vector[j])
{
maxim = best[j];
}
}
best[i] = 1 + maxim;
if (best[i] > result)
{
result = best[i];
}
maxim = 0;
}
g << result;
}
int main()
{
f >> n;
for (int i = 0; i < n; i++)
{
f >> vector[i];
}
pd();
}