4 solutions

  • 2
    @ 2025-7-17 14:55:21

    #include <bits/stdc++.h> using namespace std; int a[1005], n;

    int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } cout << max_element(a, a + n) - a + 1; return 0; }

    • 1
      @ 2025-7-17 15:01:45

      #include <bits/stdc++.h> using namespace std; int a[10000005], n;

      int main() { cin >> n; for (int i = 0; i <= n; i++) { cin >> a[i]; } cout << max_element(a, a + n) - a + 1; return 0; }

      • -1
        @ 2025-7-17 14:50:45

        kdjfhskfdjhksdhfkdhfkjdfhjkdhfkjdsfhkjdshfjkdhfskjdfhkjsdhfkjsdfhkjdsfhkjdshfjksdhfkjdfhkjsdhfkjhdsfkjsf

        • -2
          @ 2025-7-17 14:54:34

          #include <bits/stdc++.h> using namespace std;

          int main() { cin>>n; for(int i=0;i<=n;i++){ cin>>a[i]; } cout<<max_element(a,a+n)-a+1; return 0; }

          • 1

          Information

          ID
          352
          Time
          1000ms
          Memory
          64MiB
          Difficulty
          2
          Tags
          # Submissions
          54
          Accepted
          32
          Uploaded By