最长平台

#include <stdio.h>int longest_plateau(int x[],int n)//计算最长平台长度{int length = 1;int i;for(i = 1; i < n; i++){if(x[i] == x[i-length]){length++;}}return length;}int main(){int array[20] = {0,0,1,1,1,2,2,2,2,3,3,4,5,5,6,7,7,8,9,9};//给定从小到大排好序的数组int n = sizeof(array)/sizeof(int);//计算数组长度printf("The Given Array : /n");for(int i=0;i<n;i++){printf("%5d",array[i]);}printf("/n");printf("最长平台长度：%d/n",longest_plateau(array,n));//打印输出return 0;}