Pagini recente » Cod sursa (job #833400) | Cod sursa (job #364303) | Cod sursa (job #2870227) | Cod sursa (job #3241788) | Cod sursa (job #910195)
Cod sursa(job #910195)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100001],l[100001],lmax;
void dinamic()
{
int max,i,j;
l[n]=1;
for (i=n-1;i>=1;i--)
{
max=0;
for (j=i+1;j<=n;j++)
if (l[j]>max && a[i]<=a[j])
max=l[j];
l[i]=max+1;
if (lmax<l[i])
lmax=l[i];
}
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
dinamic();
/*int lmax=l[1];
int poz=1;
for(int i=2;i<=n;i++)//caut lungimea maxima
{
if(l[i]>lmax)
{
lmax=l[i];
poz=i;
}
}
g<<a[poz]<<" ";
int aux=poz;
for(int i=poz+1;i<=n;i++)
{
if(a[i]>aux)
{
g<<a[i]<<" ";
aux=a[i];
}
}*/
int p,pp;
pp=0;
p=1;
do
{
while (l[p]!=lmax || a[pp]>a[p])
p++;
g<<a[p]<<" ";
pp=p;
lmax--;
}while (lmax!=0);
f.close();
g.close();
return 0;
}