Pagini recente » Cod sursa (job #356547) | Cod sursa (job #1424333) | Cod sursa (job #1685396) | Cod sursa (job #2011136) | Cod sursa (job #2758984)
#include<fstream>
using namespace std;
long long int v[100000],p[100000];
int main(){
ifstream in("scmax.in");
ofstream out("scmax.out");
long long int n,m=0,pozitie=0,l;
v[0]=0;
p[0]=0;
in>>n;
for(long long int i=1;i<=n;i++){
in>>v[i];
}
for(long long int i=1;i<=n;i++){
if(v[i]>v[i-1]){
p[i]=p[i-1]+1;
}else{
if(v[i]==v[i-1]){
p[i]=p[i-1];
}else{
p[i]=1;
}
}
if(m<p[i]){
m=p[i];
pozitie=i;
}
}
out<<m<<'\n';
l=pozitie;
while(p[l]>=p[l-1] && l>1){
l--;
}
for(long long int i=l;i<=pozitie;i++){
if(v[i]!=v[i-1]){
out<<v[i]<<" ";
}
}
}