Cod sursa(job #863168)
Utilizator | Data | 23 ianuarie 2013 15:43:27 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,nr,k=1;
long long a[100001],b[100001];
int main()
{ f>>n;
for(i=1;i<=n;i++) { f>>a[i];
if(a[i]<=a[i-1]) { i--;
n--;
}
else { b[k]=a[i];
k++;
nr++;
}
}
g<<nr<<'\n';
for(k=1;k<=nr;k++) g<<b[k]<<" ";
return 0;
}