Submission #686385

#TimeUsernameProblemLanguageResultExecution timeMemory
686385pere_gil송신탑 (IOI22_towers)C++17
0 / 100
12 ms1352 KiB
#include "towers.h"
#include "bits/stdc++.h"
using namespace std;

int n,k;
vector<int> h;

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

int max_towers(int l, int r, int d){
	if(l<k && k<r) printf("2\n");
	else if(l==r) printf("1\n");
	else printf("0\n");
	
	return 0;
}
#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...