Pagini recente » Infoarena Monthly 2014 - Runda 9, Solutii | Cod sursa (job #3179095) | Cod sursa (job #2836721) | Cod sursa (job #1310913) | Cod sursa (job #1916628)
//subsir nr consec max
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int lmax,lcur=1,a[100000],n,fr[100000],sir[100000],poz,k=1,kmax;
int main()
{f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
fr[n]=1;
sir[n]=k;
for(int i=n-1;i>=1;i--)
{int maxcur=0,pozcur=-1;
for(int j=i+1;j<=n;j++)
{if(a[i]<a[j]&&fr[j]>maxcur)
{maxcur=fr[j];
pozcur=j;}}
if(pozcur==-1)
{fr[i]=1;
sir[i]=++k;}
else
{sir[i]=sir[pozcur];
fr[i]=maxcur+1;}
if(fr[i]>lmax)
{lmax=fr[i];
poz=i;
kmax=sir[i];}}
g<<lmax<<'\n';
for(int i=1;i<=n;i++)
if(fr[i]==lmax)
{g<<a[i]<<" ";
lmax--;
}
return 0;
}