제출 #1147793

#제출 시각아이디문제언어결과실행 시간메모리
1147793njoopGap (APIO16_gap)C++17
0 / 100
47 ms9568 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long mx, mn, l, r; vector<long long> arr; long long findAns() { long long ans = 0; sort(arr.begin(), arr.end()); for(int i=0; i<arr.size()-1; i++) { ans = max(ans, arr[i+1]-arr[i]); } return ans; } long long findGap(int T, int N) { for(int i=1; i<=1000000; i++) { arr.push_back(100000000-i); } sort(arr.begin(), arr.end()); return findAns(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...