莫强头
by desize @ 2019-10-24 16:04:16
@[倒霉的总是我](/space/show?uid=72095) awsl，大佬求教
by 花小鹿 @ 2019-10-24 16:13:43
@[A001922154](/space/show?uid=230797) for(int i=1;i<n;i++)
by wmy_goes_to_thu @ 2019-10-24 16:18:42
else y=max(y,x)
by wmy_goes_to_thu @ 2019-10-24 16:20:44
#include<algorithm>
by wmy_goes_to_thu @ 2019-10-24 16:20:57
@[wangmaohua20090908](/space/show?uid=107484) 就10分
by 花小鹿 @ 2019-10-24 16:32:49
还是不对
by 花小鹿 @ 2019-10-24 16:32:56
看起来代码没问题
by 花小鹿 @ 2019-10-24 16:36:03
```cpp
#include<iostream>
#include<algorithm>
using namespace std; int main() { int n,y=0; int x=1,t[10000000]={}; cin>>n; for(int i=1;i<=n;i++){ cin>>t[i]; } for(int i=1;i<n;i++){ if(t[i]<t[i+1]) x++; else y=max(y,x),x=1; } cout<<y; return 0; }
```
@[A001922154](/space/show?uid=230797)
by wmy_goes_to_thu @ 2019-10-24 16:42:47
include<iostream>
using namespace std;
int main() {
int n,y=0;
int x=0,t[1000]={};
cin>>n;
for(int i=1;i<=n;i++){
cin>>t[i];
}
for(int i=1;i<=n;i++){
if(t[i]<t[i+1]) x++;
else x=0;
}
cout<<x;
return 0;
}
xixi
by Lhy2009 @ 2019-11-03 20:59:10