序列是否能够由进出栈得到

#include<stdio.h>#include<stdlib.h>/* *关键点在于:每个数后面比它小的数都应按严格递减排列 *4 3 2 5 1  ok *5 3 1 4 2  no */int a[100];int main(){int N = 0;int j = 0;int m = 0;int last = 0;int flag = 1;printf("\n请输入个数:");scanf("%d",&N);printf("\n请输入:\n");for(;m<N;m++){scanf("%d",&j);a[m] = j;}for(m = 0;m<N;m++){last = a[m];for(j = m+1;j<N;j++){if(a[j]<a[m])if(a[j]<last)last = a[j];else{flag  = 0;//printf("a[m] is%d\n",a[m]);//break; 不能直接breakgoto mmm;}}}mmm:if(flag)printf("right\n");elseprintf("wrong\n");return 0;}

1、http://blog.csdn.net/liveas/article/details/5735138这个博客分析的明确。

2、小逸是良民