# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3245 | joonas | 최댓값 (tutorial2) | C11 | 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>
int* arr;
int main(){
int i, N, max=0;
scanf("%d", &N);
for(i=0; i < N; ++i){
scanf("%d", &arr[i]);
if( arr[i] > max ) max = arr[i];
}
return 0;
}