Cod sursa(job #1160624)
Utilizator | Data | 30 martie 2014 17:53:17 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[1000],g[1000],i,aux,lung,n,poz,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;
}