Pagini recente » Cod sursa (job #2985543) | Cod sursa (job #2713783) | Cod sursa (job #1161927) | Cod sursa (job #1812126) | Cod sursa (job #1354023)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int N;
int maxim;
int A[100002], dp[100002];
void solve()
{
dp[1] = 1;
maxim = 1;
for (int i = 2; i <= N; ++i)
{
dp[i] = 1;
for (int j = 1; j < i; ++j)
if (A[i] > A[j] && dp[i] < dp[j] + 1)
{
dp[i] = dp[j] + 1;
if (dp[i] > maxim)
maxim = dp[i];
}
}
}
int main()
{
fin >> N;
for (int i = 1; i <= N; ++i)
fin >> A[i];
solve();
fout << maxim << '\n';
fin.close();
fout.close();
return 0;
}