1 solutions

  • 1
    @ 2025-3-28 19:14:15
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1e5+10;
    int a[N];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i];
    	}
    	int res=0;
    	for(int i=1;i<=n;i++)
    	{
    		int j=i+1;
    		while(j<=n&&a[j]>a[j-1]) j++;
    		j--;
    		int len=j-i+1;
    		res=max(res,len);
    		i=j;
    	}
    	cout<<res;
        return 0;
    }
    
    • 1

    太阳黑子最大数量一直增加的最长连续年数

    Information

    ID
    670
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    3
    Tags
    # Submissions
    40
    Accepted
    10
    Uploaded By