제출 #1218424

#제출 시각아이디문제언어결과실행 시간메모리
1218424bangan송신탑 (IOI22_towers)C++20
0 / 100
4058 ms1952 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; #define chmax(a, b) a = max(a, b) #define pb push_back const int maxn = 1e5 + 4; int n; int h[maxn]; int dp[maxn]; int pre[maxn]; int local_min(int i) { if (1 <= i-1 && h[i] > h[i-1]) return 0; if (i+1 <= n && h[i] > h[i+1]) return 0; return 1; } void init(int N, std::vector<int> H) { n = N; for (int i=1; i<=n; i++) h[i] = H[i-1]; for (int i=1; i<=n; i++) pre[i] = pre[i-1] + local_min(i); } int max_towers(int L, int R, int D) { if (L==R) return 1; L++; R++; int mx = 0; vector<int> stk{1}; for (int i = 2; i <= R; i++) { if (h[i] <= mx-D && h[stk.back()] <= mx-D) stk.pb(i), mx=0; else if (h[i] < h[stk.back()]) { stk.pop_back(); stk.pb(i); mx=0; } else chmax(mx, h[i]); } int ans = 0; for (int i : stk) ans += (i >= L); return max(ans, 1); }
#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...