Pagini recente » Cod sursa (job #106978) | Cod sursa (job #1383421) | Cod sursa (job #2160355) | Cod sursa (job #1090364) | Cod sursa (job #2477567)
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
long long v[100007];
int dp[2][100007];
int main()
{
ios::sync_with_stdio(false);
in.tie(0);
int n;
in >> n;
for(int i = 1 ;i <= n;i++)
in >> v[i];
int l = 0;
for(int i = 1; i <= n; i++ , l = 1-l)
for(int j = 1; j <= n;j++)
if(v[i] < v[j])
dp[l][j] = dp[1-l][j]+1;
else
dp[l][j] = max(dp[1-l][j],dp[l][j-1]);
out << dp[1][n];
return 0;
}