Pagini recente » Cod sursa (job #2084169) | Cod sursa (job #2035700) | Cod sursa (job #1652629) | Cod sursa (job #993229) | Cod sursa (job #2133595)
#include <bits/stdc++.h>
#define DMAX 100010
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,unde,loc;
int V[DMAX];
int lg[DMAX];
int urmator[DMAX];
void citire();
void cautare(int j);
int main()
{citire();
lg[n-1]=1;
urmator[n-1]=-1;
for(int i=n-2;i>=0;i--)
cautare(i);
int catemax=0,poz;
for(int i=0;i<n;i++)
if(catemax<lg[i])
{catemax=lg[i];
poz=i;
}
fout<<catemax<<'\n';
do
{fout<<poz+1<<' ';
poz=urmator[poz];
}while(urmator[poz]!=-1);
fout<<poz+1<<'\n';
return 0;
}
void citire()
{int i;
fin>>n;
for(i=0;i<n;i++)
fin>>V[i];
}
void cautare(int j)
{int catemax=0,unde,i;
for(i=j+1;i<n;i++)
if(V[j]<V[i] && lg[i]+1>catemax)
{catemax=lg[i]+1;
unde=i;
}
if(catemax)
{lg[j]=catemax;
urmator[j]=unde;
}
else
{lg[j]=1;
urmator[j]=-1;
}
}
/// O(n2)