# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119565 | Diuven | 최댓값 (tutorial2) | C++14 | 0 ms | 0 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.
int GetMax(int n, int A[]){
int mx = -1e9;
for(int i=0; i<n; i++) mx = max(mx, A[i]);
return mx;
}