Submission #667090

#	Time	Username	Problem	Language	Result	Execution time	Memory
667090		tatyam	Radio Towers (IOI22_towers)	C++17	0 / 100	761 ms	1824 KiB

towers

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


int N;
vector<int> H;
vector<int> S;
void init(int N, vector<int> H) {
    ::N = N;
    ::H = H;
    S.resize(N);
    for(int i = 1; i + 1 < N; i++) S[i] = S[i - 1] + (H[i - 1] < H[i] && H[i] > H[i + 1]);
}

int max_towers(int L, int R, int D) {
    assert(D == 1);
    return S[R - 1] - S[L] + 1;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23