4 solutions

  • 7
    @ 2025-6-22 14:58:41
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n;
    	cin>>n;
    	int last=-1;
    	for(int i=1;i<=n;i++)
    	{
    		int x;
    		cin>>x;
    		if(x>last) //持续上升 
    		{
    			last=x;
    		} 
    		else //无法移动了 
    		{
    			break;
    		}
    	}
    	cout<<last;
    	return 0;
    }
    
    • 5
      @ 2025-6-21 9:58:47
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          bool jud=true;
          int n,now;
          cin>>n;
          for(int i=1;i<=n;i++)
          {
              int x;
              cin>>x;
              if(i==1) now=x;
              else
              {
                  if(x>now && jud) now=x;
                  else jud=false;
              }
          }
          cout<<now;
          return 0;
      }
      
      • 1
        @ 2026-8-11 13:41:34
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
            int n;
        	cin>>n;
        	int maxv=-1;
        	for(int i=1;i<=n;i++)
        	{
        		int x;
        		cin>>x;
        		if(x>maxv)
        		{
        			maxv=x;
        		}
        		else
        		{
        			break;
        		}
        	}
        	cout<<maxv;
        	return 0; 
        }
        
        • 0
          @ 2026-7-31 11:13:16
          #include<bits/stdc++.h>
          using namespace std;
          int main(){
              int n,s=0;
              cin>>n;
              for(int i=1;i<=n;i++)
              {
                  int a;
                  cin>>a;
                  if(a>s) s=a;
                  else break;
              }
              cout<<s;
              return 0;
          }
          
          • 1

          Information

          ID
          2333
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          152
          Accepted
          66
          Uploaded By