# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8562 | a555 | 최댓값 (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 <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <bitset>
#include <numeric>
#pragma warning(disable:4996)
#define REP(variable, repeatnumber) for(int variable=0; variable<(repeatnumber); ++variable)
#define FOR(variable, start, end) for(int variable=(start); variable<=(end); ++variable)
#define RFOR(variable, start, end) for(int variable=(start); variable>=(end); --variable)
#define ULL unsigned long long
#define LL long long
using namespace std; // 700B
int n, k, tb[11];
int GetMax(int N, int *A){
int b = 0;
REP(i, n){
if (b < A[i]) b = A[i];
}
return b;
}
int main()
{
scanf("%d", &n);
REP(i,n) scanf("%d", &tb[i]);
printf("%d\n", GetMax(n, tb));
return 0;
}