Cod sursa(job #1436607)
| Utilizator | Data | 16 mai 2015 10:12:39 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, i, j, v[1000005], l[1000005], maxim, p, lmax, pozmax;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=n; i>=1; i--)
{
maxim=1;
p=v[i];
for(j=i; j<=n; j++)
{
if(p<v[j])
{
p=v[j];
maxim++;
}
}
l[i]=maxim;
}
for(i=1; i<=n; i++)
if(lmax < l[i])
{
lmax=l[i];
pozmax=i;
}
fout<<lmax<<"\n";
p=v[pozmax];
fout<<p<<" ";
for(i=pozmax; i<=n; i++)
{
if(p<v[i])
{
p=v[i];
fout<<p<<" ";
}
}
}
