解题思路:将数值大于T的存入vector数组里,然后用嵌套循环即可
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t,count,max=0;
bool flag=false;
cin>>n>>t;
int a[n+1];
vector<int>vt;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]>t){
vt.push_back(i);
flag=true;
}
}
for(int i=0;i<vt.size()&&flag;i=i+max+1){
count=vt[i];
max=0;
for(int j=i+1;j<vt.size();j++){
if(vt[j]==vt[j-1]+1)
max++;
else
break;
}
cout<<"["<<count<<","<<" "<<count+max<<"]"<<endl;
}
if(!flag)
cout<<*max_element(a,a+n);
}
运行结果: