Pagini recente » Cod sursa (job #661667) | Cod sursa (job #2415696) | Cod sursa (job #1358178) | Cod sursa (job #1159444) | Cod sursa (job #830839)
Cod sursa(job #830839)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100001], l[100001];
void citire()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
}
int cauta(int i)
{
int maxx = 0;
int k = i - 1;
for(int j = i; j <= n; j++)
{
if(v[j] > v[k])
if(l[j] > maxx)
maxx = l[j];
}
return maxx;
}
int main()
{
citire();
l[n] = 1;
int i = n - 1;
while(i > 0)
{
l[i] = 1 + cauta(i + 1);
i--;
}
int maxim=0, p;
for(i=1; i<=n; i++)
if(l[i]>maxim)
{
maxim=l[i];
p=i;
}
fout<<maxim<<"\n";
fout<<v[p]<<" ";
for(i=p+1; i<=n; i++)
if(v[i]>v[p])
{
fout<<v[i]<<" ";
p=i;
}
fin.close();
fout.close();
return 0;
}