Pagini recente » Cod sursa (job #1334103) | Cod sursa (job #818427) | Cod sursa (job #3142561) | Cod sursa (job #219000) | Cod sursa (job #1506197)
//cel mai lung subsir crescator
#include <fstream>
using namespace std;
int n,m,i,j,p,maxi,a[100005],v[100005];
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
a[n]=1;
for(i=n-1; i>=1; i--)
{
maxi=0;
for(j=i+1; j<=n; j++)
if(v[i]<v[j]&&a[j]>maxi)
maxi=a[j];
a[i]=maxi+1;
}
maxi=0;
for(i=1; i<=n; i++)
if(a[i]>maxi)
{
maxi=a[i];
p=i;
}
g<<maxi<<endl;
g<<p<<" ";
maxi--;
for(i=p+1; i<=n; i++)
if(a[i]==maxi&&v[i]>v[p])
{
g<<i<<" ";
maxi--;
p=i;
}
return 0;
}