Array Maximum

0.5s 256M

Implement a function named array_max. The grader gives you an integer array a and an integer num, where num is the number of elements to inspect. You need to return the maximum value among those num integers.

You need to implement the following function:

int array_max(int a[], int num);
  • The official grader will prepare an int array and call array_max(a, num);.
  • You only need to inspect a[0] through a[num - 1].
  • The function must return the maximum value among these num elements.
  • Do not handle input or output by yourself.
  • The judge will inspect your source code. Calling helpers such as max, max_element, or sort is forbidden. Use a loop inside array_max to find the maximum yourself.

Input

The sample grader uses the following input format:

T
num_1
a_{1,1} a_{1,2} ... a_{1,num_1}
num_2
a_{2,1} a_{2,2} ... a_{2,num_2}
...
num_T
a_{T,1} a_{T,2} ... a_{T,num_T}

Here, \(T\) is the number of times the sample grader calls array_max.

Note that in the official judging, you do not read input yourself; the grader directly calls the function you implement.

Constraints

  • \(1 \le T \le 50\)
  • \(1 \le num \le 100\)
  • \(-10^9 \le a_i \le 10^9\)

Output

After each call to array_max(a, num);, the sample grader prints the maximum value returned by the function.

Note that in the official judging, you do not print output yourself.

Sample Input 1

3
3
1 5 3
4
-7 -2 -9 -4
1
0

Sample Output 1

5
-2
0

Sample Explanation 1

In the first test, the first 3 elements are 1, 5, 3, and their maximum is 5.

Sample Input 2

3
4
100 -100 50 99
3
-5 -5 -5
3
1000000000 0 -1000000000

Sample Output 2

100
-5
1000000000

Local Testing Template

To test locally, paste your implementation of array_max into the marked place in the following program and compile it:

#include <iostream>
using namespace std;

// Paste your implementation of array_max here.
// int array_max(int a[], int num) {
// }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        int num;
        cin >> num;
        int a[100];
        for (int i = 0; i < num; ++i) {
            cin >> a[i];
        }
        cout << array_max(a, num) << '\n';
    }
}

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test: about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test has a 15 second wall-clock cap; sample tests use the problem time limit, the same as the official judge
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.