Cod sursa(job #2922536)
| Utilizator | Data | 8 septembrie 2022 20:18:54 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100005],aib[100005],maxi=INT_MIN,dp[100005];
int main()
{
int i,val,maxi1=INT_MIN,j;
f>>n;
for(i=1;i<=n;i++)
f>>v[i],dp[i]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<i;j++)
{
if(v[i]>v[j])
dp[i]=dp[j]+1;
}
}
maxi=INT_MIN;
for(i=1;i<=n;i++)
maxi=max(maxi,dp[i]);
g<<maxi;
return 0;
}
