제출 #1036954

#제출 시각아이디문제언어결과실행 시간메모리
1036954XJP12송신탑 (IOI22_towers)C++17
0 / 100
4014 ms1368 KiB
#include <bits/stdc++.h>
#include "towers.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
vi v;
int n;
void init(int N, vi h) {
	v=h;
	n=N;
}

int max_towers(int l, int r, int d) {
	int ans=0;
	int v1=-1;
	int p1=-1;
	bool ban=false;
	for(int i=l+1; i<=r; i++){
		//cout<<v1<<p1<<v[i-1]<<endl;
		if(v[i]<v[i-1]){
			if(p1!=-1){
				if(p1-v1<d){
					p1=v1=-1;
				}else{
					ban=true;
				}
			}
		}
		if(v[i]>v[i-1]){
			if(ban==true){
				if(p1-v[i-1]>=d){ ans++; /*cout<<v1<<" "<<p1<<" "<<v[i-1]<<endl;*/}
				ban=false;
			}
			if(v1==-1){
				v1=v[i-1];
			}
			p1=v[i];	
		}
	}

  return ans;
}
#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...