Cod sursa(job #1151971)
Utilizator | Data | 24 martie 2014 14:40:02 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,p[100000],nr;
long a[100000];
int main()
{
f>>n;
int dif=0;
for(i=1;i<=n;i++) f>>a[i];
if(a[1]>a[2]) {p[2]=1; j=2; nr++;}
else {p[1]=1; j=1; nr++;}
for(i=2;i<=n;i++) {
dif=dif+a[i]-j;
if(dif>0) {
nr++;
j=a[i];
p[i]=1;
dif=0;
}
else {
p[i]=0;
}
}
nr--;
g<<nr<<"\n";
for(i=1;i<=n;i++) if(p[i]==1) g<<a[i]<<" ";
}