Cod sursa(job #2264487)
Utilizator | Data | 20 octombrie 2018 09:57:40 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100],i,j,dp[100],mx=0;
f>>n;
for(i=1;i<=n;i++)
dp[i]=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++){
if(dp[i]==0)dp[i]=1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j])
dp[j]=max(dp[j],dp[i]+1);
if(dp[i]>mx)mx=dp[i];
}
g<<mx;
}