sicily 1137 河床

// source code of submission 733540, Zhongshan University Online Judge System #include <iostream> #include <algorithm> using namespace std; int depth[30006],a[30000]; int max_dis(int a [],int t) //求某个区间内最大数与最小数之差 { sort(a,a+t); return (a[t-1] - a[0]); } int main() { int n,i,j,num,max = -1; int k,m,dis; cin>>n>>k; for(i = 0;i < n;i++) cin>>depth[i]; for(i = 0;i<n;i++) { num = 1; for(j = i+1;j<n;j++) { int cnt = 0; for(m = i;m<=j;m++) a[cnt++] = depth[m]; if(max_dis(a,cnt) <= k) { num++; continue; } else break; } if(max < num) { max = num; } } cout<<max<<endl; return 0; }