oj.uz

Submission #164278

# Submission time Handle Problem Language Result Execution time Memory
164278 2019-11-18T21:47:50 Z daddy0h 최댓값 (tutorial2) C++11
100 / 100
 12 ms 384 KB 
/// https://oj.uz/problem/view/tutorial2

#include <bits/stdc++.h>

using namespace std;

int GetMax(int N, int A[])
{
    int t_max = -987654321;
    for(int id=0; id<N; ++id)
    {
        if(A[id] > t_max) t_max = A[id];
    }

    return t_max;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 12 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #2
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct