最大递增子数列

 

#define MAX(A,B)((A)>=(B)?(A):(B))
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string.h>
using namespace std;
int zxl(int *a,int n_values);
int main()
{
char str[1000];
scanf("%s",str);
int n_values;
n_values=strlen(str);
int *array;
int i;
array=(int*)malloc(n_values*sizeof(int));
if(array==NULL)
{
printf("can't get memory for that many values\n");
exit(EXIT_FAILURE);
}
for (i=0;i<n_values;i+=1)
{
array[i]=str[i]-'0';
}
printf("%d",zxl(array,n_values));
free(array);
return EXIT_SUCCESS;
}
int zxl(int *a,int n_values)
{
int i=0;
int j=0;
int k=0;
int b[1000]={0};
int max=0;
for(i=0;i<n_values-1;i+=1)
{
if(a[i]<a[i+1]) b[j]=b[j]*10+a[i];
if(a[i]>=a[i+1]) {b[j]=b[j]*10+a[i];j+=1;}
}
if(a[n_values-2]<a[n_values-1]) b[j]=b[j]*10+a[n_values-1];
if(a[n_values-2]>=a[n_values-1]) b[j]=a[n_values-1];

for(k=0;k<=j;k++)
max=MAX(max,b[k]);
return max;
}