제출 #967881

#제출 시각아이디문제언어결과실행 시간메모리
96788112345678송신탑 (IOI22_towers)C++17
14 / 100
561 ms2116 KiB
#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+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...