# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19194 | anrhks1212 | 최댓값 (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>
using namespace std;
int GetMax(int N, int *A);
int main()
{
int N;
cin >> N;
int *A = new int[N - 1];
cout<<GetMax(N, A);
return 0;
}
int GetMax(int N, int *A)
{
int i=0, max=0;
for (i = 0; i<N; i++)
{
cin >> A[i];
}
max = A[0];
for (i = 0; i < N - 1; i++)
{
if (max < A[i + 1])
{
max = A[i + 1];
}
}
return max;
}