Cod sursa(job #934842)
Utilizator | Data | 31 martie 2013 17:58:38 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
using namespace std;
int main(){
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
int n,r,max=0,ap=0,l=0,c;
scanf("%d",&n);
int v[n];
for(int i=0;i<n;i++)
scanf("%d",&v[i]);
for(int i=0;i<n-1;i++){
if(v[i]+1==v[i+1])
ap++;
if(v[i]+1!=v[i+1])
ap=0;
if(max<ap){
max=ap;
r=i+1-ap; c=1+ap;
}
}
while(l!=c){
printf("%d ",v[r]);
r++;
l++;
}
return 0;
}