제출 #836551

#제출 시각아이디문제언어결과실행 시간메모리
836551tengiz05송신탑 (IOI22_towers)C++17
0 / 100
527 ms1744 KiB
#include "towers.h"

#include <bits/stdc++.h>
using namespace std;

vector<int> h;
int n;
vector<int> a;
void init(int N, vector<int> H) {
    n = N;
    h = H;
    a.resize(n);
    for (int i = 1; i < n - 1; i++) {
        if ((h[i - 1] < h[i]) != (h[i] < h[i + 1])) {
            a[i]++;
        }
    }
    for (int i = 1; i < n; i++) {
        a[i] += a[i - 1];
    }
}

int max_towers(int l, int r, int D) {
    int sum = a[r - 1] - a[l];
    if (h[l] > h[l + 1]) {
        sum--;
    }
    return max(1, (sum + 1) / 2);
}
#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...