Cod sursa(job #1160647)
| Utilizator | Data | 30 martie 2014 18:04:26 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100000],g[100000],i,aux,lung,n,poz=0,j;
int main()
{
fin>>n;
for(i=0;i<n;i++)
fin>>v[i];
g[0]=v[0];
for(i=0;i<n;i++)
{
if(g[poz]<v[i+1])
{
g[poz+1]=v[i];
lung++;
poz=i;
}
}
fout<<lung<<'\n';
for(i=0;i<n;i++)
if(g[i]!=0)
fout<<g[i]<<" ";
return 0;
}
