Pagini recente » Cod sursa (job #239953) | Cod sursa (job #193390) | Cod sursa (job #1296712) | Cod sursa (job #73170) | Cod sursa (job #574233)
Cod sursa(job #574233)
#include<iostream>
#include<fstream>
using namespace std;
int a[100000],b[100000];
int main()
{ int n,i,j,min,max,q,p,k;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
b[1]=1;
for(i=1;i<=n;i++)
{
b[i]=1;
for(j=1;j<=i;j++)
{
if(a[j]<a[i]&&b[j]>=b[i])
{
b[i]=1;
b[i]+=b[j];
}
}
if(b[i]>max) max=b[i];
}
max=1;
for(i=q;i<=n;i++)
{
cout<<b[i]<<" ";
if(b[i]>max) max=b[i];
}
fout<<max<<endl;
p=1;
for(i=1;i<=max;i++)
{
for(j=p;j<=n;j++)
{
if(b[j]==i)
{
min=a[j];
q=j;
k=j;
break;
}
}
for(j=q;j<=n;j++)
{
if(b[j]==b[q]&&a[j]<min)
{
min=a[j];
k=j;
}
}
p=k;
fout<<p<<" ";
}
fin.close();
fout.close();
return 0;
}