5 solutions

  • 7
    @ 2025-5-14 20:18:34
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n;
    	cin>>n;
    	int last;
    	cin>>last;
    	int ans=-1;
    	for(int i=2;i<=n;i++)
    	{
    		int x;
    		cin>>x;
    		if(x>last)
    		{
    			ans=i;
    			break;
    		}
    	}
    	cout<<ans;
        return 0;
    }
    
    
    • 0
      @ 2026-8-5 16:32:28
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
          int n;
      	cin>>n;
      	int maxv;
      	cin>>maxv;
      	for(int i=2;i<=n;i++)
      	{
      		int x;
      		cin>>x;
      		if(x>maxv)
      		{
      			maxv=x;
      			cout<<i;
      			return 0;
      		}
      	}
          cout<<"-1";
      	return 0;
      }	 
      
      
      • 0
        @ 2026-2-3 14:39:24

        #include<bits/stdc++.h> using namespace std; int n,h,m; int main() { int n; cin>>n; int last; cin>>last; int ans=-1; for(int i=2;i<=n;i++) { int x; cin>>x; if(x>last) { ans=i; break; } } cout<<ans; return 0;

        • `
        • [ ] `
        1. - > ```[language]($$)*~~~~*
        

        `

        1. } ``
        `
        • -2
          @ 2025-6-21 9:43:21
          #include<bits/stdc++.h>
          using namespace std;
          int main()
          {
              int n,lt,a=-1;
              cin>>n;
              for(int i=1;i<=n;i++)
              {
                  int x;
                  cin>>x;
                  if(i==1) lt=x;
                  else if(x>lt)
                  {
                      a=i;
                      break;
                  }
              }
              cout<<a;
              return 0;
          }
          
          • -3
            @ 2025-3-30 14:18:49
            #include<bits/stdc++.h>
            using namespace std;
            int main()
            {
            	int n,m,is=0;cin>>n>>m;
            	for (int i=2;i<=n;i++)
            	{
            		int h;cin>>h;
            		if (h>m){cout<<i;is=1;break;}
            	}
            	if (is==0)cout<<-1;
            	return 0;
            }
            
            • 1

            Information

            ID
            2346
            Time
            1000ms
            Memory
            256MiB
            Difficulty
            1
            Tags
            (None)
            # Submissions
            169
            Accepted
            69
            Uploaded By