```
#include <bits/stdc++.h>
using namespace std;
int a[1000001];
int main(){
int n,ma=INT_MIN,ans=1;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
if(a[i+1]>a[i]){
ans++;
}
else ans=1;
ma=max(ans,ma);
}
cout<<ma;
}
```
by tangguo_yyds @ 2023-02-16 22:31:42
@[kevin3](/user/735452) 答案的迭代每次循环都要
by Blue_Flower @ 2023-02-16 22:38:19
大佬，你黑题都会做了，怎么做红题都会有失误呢
```
if(a[i]<=a[i-1]){
ma=max(ma,ans);
ans=1;
}
else{
ans++;
}
```
这个判断有问题，~~但本蒟蒻暂时没找到问题所在~~
by tangguo_yyds @ 2023-02-16 22:40:12
```
#include<bits/stdc++.h>
using namespace std;
int n,a[1000001],ma,ans,s;
int main() {
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(a[i]<=a[i-1]){
ans=1;
}
else{
ans++;
}
ma=max(ma,ans);
}
cout<<ma<<endl;
return 0;
}
```
by Blue_Flower @ 2023-02-16 22:40:51
@[tangguo_yyds](/user/727613)
判断是对的，只是答案没迭代
by Blue_Flower @ 2023-02-16 22:41:49
@[liuhanming__nb](/user/882193)
确实，我忽视了这个问题，大佬orz
by tangguo_yyds @ 2023-02-16 22:44:13