| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 12832 | yongwhan | 최댓값 (tutorial2) | C++98 | 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.
#include<iostream>
#include<algorithm>
using namespace std;
int GetMax(int N, int A[]) {
int mx=A[0];
for (int i=0; i<n; i++) mx=max(mx,A[i]);
return mx;
}