Cod sursa(job #1753763)
Utilizator | Data | 7 septembrie 2016 10:01:10 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream f ("subsir.in");
ofstream g ("subsir.out");
int a[1002],b[1002],M,Max,i,p,j,v[1002],n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
a[n]=1;
M=0;
for(i=n-1;i>=1;i--)
{
Max=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&a[j]>Max)
{
Max=a[j];
b[j]=j;
}
a[i]=Max+1;
if(a[i]>M)
{
M=a[i];
p=i;
}
}
g<<M;
g<<'\n'<<v[p]<<" ";
M--;
for(i=p+1;i<=n;i++)
if(v[i]>v[p]&&a[i]==M)
{
g<<v[i]<<" ";
p=i;
M--;
}
return 0;
}