习题3.4 最长连续递增子序列 (20分)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main(){
    int n,i=0,ch,flag=0;
    scanf("%d",&n);
    int a[n];
    int mark[n];//记录从耨个位置开始递增的长度
    memset(mark,0,sizeof(mark));
    scanf("%d",&a[0]);
    for(i=1;i<n;i++){
        scanf("%d",&a[i]);
        if(a[i]>a[i-1]){
            mark[flag]++;
        }else{
            flag = i;
        }
    }
    int max=mark[0],f=0;
    for(i=1;i<n;i++){
        if(max<mark[i]){
            max = mark[i];
            f = i;
        }
    }
    int count = 0;
    for(i=f;i<f+max+1;i++){
        if(count==0){
        printf("%d",a[i]);
        count++;
        }else{
            printf(" %d",a[i]);
        }
    }
}