# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164278 | daddy0h | 최댓값 (tutorial2) | C++11 | 12 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/// 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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |