| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145781 | j07801 | 최댓값 (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.
#include<stdio.h>
#include<algorithm>
#include<iostram>
using namespace std;
int mix;
int GetMax(int N, int *A){
mix = A[0];
for (int i = 1; i <= N; i++){
mix = max(mix, A[i]);
}
return mix;
}