Cod sursa(job #2856601)
Utilizator | Data | 24 februarie 2022 09:46:17 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.86 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long n,i,j;
void SCMAX()
{
f>>n;
long long v[n+1];
f>>v[1];
long long dp[n+1],s[n+1],sol,pos;
dp[1]=1;
s[1]=0;
sol=dp[1];
for(i=2;i<=n;i++)
{
f>>v[i];
dp[i]=1;
s[i]=0;
j=1;
while(j<i)
{
if(v[j]<v[i])
{
if(dp[j]+1>dp[i])
{
dp[i]=dp[j]+1;
s[i]=j;
}
}
j++;
}
}
for(i=2;i<=n;i++)
{
if(dp[i]>sol)
{
sol=dp[i];
pos=i;
}
}
g<<sol<<'\n';
for(i=sol;i>=1;i--)
{
g<<v[pos]<<' ';
pos=s[pos];
}
}
int main()
{
SCMAX();
return 0;
}