Submission #823737

#	Time	Username	Problem	Language	Result	Execution time	Memory
823737		boyliguanhan	송신탑 (IOI22_towers)	C++17	14 / 100	765 ms	1488 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
int n, pre[200100], cnt[200100];
void init(int N, vector<int> H) {
  	for(int i = 1; i < N-1; i++)
		pre[i]=pre[i-1]+(H[i]>max(H[i-1],H[i+1]));
	pre[n-1] = pre[n-2];
}
int max_towers(int L, int R, int D) {
	if(R-L<2)
		return 1;
	return pre[R-1]-pre[L]+1;
}

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