Submission #967880

#TimeUsernameProblemLanguageResultExecution timeMemory
96788012345678Radio Towers (IOI22_towers)C++17
0 / 100
10 ms2884 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; const int nx=2e3+5; int n, qs[nx]; vector<int> h; void init(int N, std::vector<int> H) { n=N; h=H; for (int i=1; i<N-1; i++) if (h[i]<h[i-1]&&h[i]<h[i+1]) qs[i]++; for (int i=1; i<N; i++) qs[i]+=qs[i-1]; } int max_towers(int L, int R, int D) { if (L==R) return 1; return qs[R-1]-qs[L]+(h[L]<h[L+1])+(h[R]<h[R-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...