3 solutions

  • 0
    @ 2025-1-17 10:50:31
    #include <bits/stdc++.h>
    using namespace std;
    map<int,int> h;
    int main()
    {
    	int n,t,l=0;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>t;
    		l=max(l,t);
    		h[t]=i;
    	}
    	cout<<h[l];
    	return 0;
    }
    • 0
      @ 2024-11-23 11:49:58
      #include<bits/stdc++.h>
      using namespace std;
      int a[1010];
      int main()
      {
      	int n,cnt=0; 
      	cin>>n;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>a[i];
      	}
      	int m;
      	cin>>m;
      	for(int i=1;i<=n;i++)
      	{
      		if(m==a[i])
      		{
      			cnt++;
      		}
      	}
      	cout<<cnt;
      	return 0;
      }
      
      • -3
        @ 2024-9-8 14:57:25

        c++'''

        #include<bits/stdc++.h> using namespace std; int a[1010]; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } int maxv=1; for(int i=1;i<=n;i++) { if(a[maxv]<a[i]) { maxv=i; } } cout<<maxv; return 0; }

        • 1

        Information

        ID
        58
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        113
        Accepted
        45
        Uploaded By