제출 #1251480

#제출 시각아이디문제언어결과실행 시간메모리
1251480raysh07송신탑 (IOI22_towers)C++17
0 / 100
4009 ms1816 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; #define int long long #define INF (int)1e18 int n; vector <int> a; void init(int32_t N, vector<int32_t> H) { n = N; a.resize(n); for (int i = 0; i < n; i++){ a[i] = H[i]; } } int32_t max_towers(int32_t l, int32_t r, int32_t d) { int ans = 1; int best = INF; int mx = -INF; for (int i = l; i <= r; i++){ if (max(a[i], best) + d <= mx){ ans++; best = a[i]; mx = -INF; } else { best = min(best, a[i]); mx = max(mx, a[i]); } } return (int32_t)ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...