제출 #19421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
19421		dotorya	최댓값 (tutorial2)	C++14	100 / 100	0 ms	1720 KiB

tutorial2

#include <algorithm>
#include <assert.h>
#include <complex>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <limits.h>
#include <locale.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <vector>
#include <unordered_set>
#include <unordered_map>

#pragma warning(disable:4996)
using namespace std;

#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <ldb, ldb> pdd;

int IT_MAX = 131072;
const ll MOD = 1000000007;
const int INF = 1034567891;
const ll LL_INF = 2234567890123456789ll;
const db PI = 3.141592653589793238;
const ldb ERR = 1E-10;

int GetMax(int N, int* in) {
	int ans = -INF;
	for (int i = 0; i < N; i++) ans = max(ans, in[i]);
	return ans;
}

• Subtask 1: 20 / 20
• Subtask 2: 80 / 80