Submission #1055615

#TimeUsernameProblemLanguageResultExecution timeMemory
1055615vjudge1Radio Towers (IOI22_towers)C++17
14 / 100
521 ms1952 KiB
#include "towers.h"

#include <vector>
using namespace std;
int valley[100100];
vector<int>H;
void init(int N, std::vector<int> H_) {
    H=H_;
    for(int i=1;i<N;i++)
        valley[i]=valley[i-1]+(H[i]<H[i-1]&&H[i]<H[i+1]);
}

int max_towers(int l, int r, int D) {
    if(l==r) return 1;
    return (H[l]<H[l+1])+(H[r-1]>H[r])+valley[r-1]-valley[l];
}
#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...