@[吉家麟](/space/show?uid=164836)
注意是10^7
by Smile_Cindy @ 2019-01-30 11:34:05
@[吉家麟](/space/show?uid=164836) 请您去计算机看看10^7是多大
by 紬文德斯 @ 2019-01-30 11:34:29
@[吉家麟](/space/show?uid=164836)
```cpp
#include<iostream>
using namespace std;
int main()
{
int a[10000001],n,i,ans=1,max=0;
cin>>n;
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n;i++)
{
if(a[i+1]>a[i]) max++;
else max=1;
if(ans<max) ans=max;
}
cout<<ans;
return 0;
}
```
by Smile_Cindy @ 2019-01-30 11:34:57
这一题不是最长上升子序列吗?
为什么是红题QAQ?
by Victorique_De_Blois @ 2019-01-30 11:36:40
@ Jack_killer
是子串,O(n)模拟即可
by Cheng_yf @ 2019-01-30 11:52:10
```cpp
数组开小了
应该是1000001
```
by _216612 @ 2019-01-30 13:26:37