source.cpp

输入一个非递减整数数组

#include<stdio.h>
 int main(int argc,char*argv[])
 {
	 int arry[30];
	 for(int i=0;i<30;i++)
	 {
		 scanf("%d",&arry[i]);
		 while(i>0 && arry[i]<arry[i-1]) 
		 {
			 printf("the error! please rewrite arry[%d].",i);
			 scanf("%d",&arry[i]);
		 }
	 }
	 int longest(int x[],int n);
	 printf("the longest plateau is %d",longest(arry[30],30));
	 return 0;
 }
int longest(int x[],int n)
 {
	 int length=1;
	 for(int i=0;i<n;i++)
		 if(x[i]==x[i-length])
			 length++;
		 return length;
 }