Submission #164278

#TimeUsernameProblemLanguageResultExecution timeMemory
164278daddy0h최댓값 (tutorial2)C++11
100 / 100
12 ms384 KiB
/// 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...