Pagini recente » Cod sursa (job #691401) | Cod sursa (job #3002105) | Cod sursa (job #1850477) | Cod sursa (job #2515305) | Cod sursa (job #498169)
Cod sursa(job #498169)
#include<fstream>
using namespace std;
int l[5002],v[5002],i,j,k,t,maxim,n,aux,c[5002];
int main()
{
ifstream f("subsir2.in");
ofstream g("subsir2.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
c[i]=i;
}
l[n]=1;
for(i=n-1;i>0;i--)
{
maxim=0;
for(k=i+1;k<=n;k++)
if(v[k]>v[i]&&l[k]>maxim)
maxim=l[k];
l[i]=maxim+1;
}
for(i=1;i<=n;i++)
if(maxim<l[i])
{
maxim=l[i];
t=i;
}
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j]&&l[i]==l[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
aux=c[i];
c[i]=c[j];
aux=c[j];
}
g<<maxim<<"\n";
g<<t<<" ";
for(i=t+1;i<=n;i++)
if(v[i]>v[t]&&l[i]==maxim-1)
{
g<<c[i]<<" ";
maxim--;
}
return 0;
}