# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8825 | xiaoyu | 최댓값 (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 <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <time.h>
#include <float.h>
#include <assert.h>
#include <stack>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) FORE(i,0,n)
#define S(v) ((int)v.size())
#define LL long long
#define ULL unsigned long long
#define ALL(v) (v).begin(), (v).end()
typedef vector<int> VI;
int main()
{
#ifdef WIN32
//freopen("input.txt","r",stdin);
#endif
int n; scanf("%d", &n);
vector<int> v(n);
REP(i,n)scanf("%d",&v[i]);
printf("%d\n", *max_element(ALL(v)));
return 0;
}