Pagini recente » Cod sursa (job #317992) | Cod sursa (job #2196465) | Cod sursa (job #907142) | Cod sursa (job #2647434) | Cod sursa (job #1984410)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMax = 100005;
int N;
int X[NMax],DP[NMax],Sol;
void Read()
{
fin >> N;
for(int i = 1; i <= N; ++i)
fin >> X[i];
}
void Solve()
{
for(int i = N; i > 0; --i)
{
int Max = 0;
for(int j = i + 1; j <= N; ++j)
if(X[i] < X[j] && DP[j] > Max)
Max = DP[j];
DP[i] = 1+ Max;
}
}
void Print()
{
for(int i = 1; i <= N; ++i)
Sol = max(Sol,DP[i]);
fout << Sol << "\n";
}
int main()
{
Read();
Solve();
Print();
return 0;
}