제출 #657799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
657799		coding_snorlax	Radio Towers (IOI22_towers)	C++17	0 / 100	4093 ms	1692 KiB

towers

#include "towers.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> All;
void init(int N,vector<int> H){
    for(int i=0;i<N;i++){
        All.push_back(H[i]);
    }
}
int recrution(int L,int R,int D){
    int Now_max=-2000000000,Max_place=-1;
    for(int i=L;i<=R;i++){
        if(All[i]>Now_max ){
            Now_max=max(Now_max,All[i]);
            Max_place=i;
        }
    }
    int flag1=0,flag2=0;
    for(int i=L;i<Max_place;i++){
        if(All[i]+D<=Now_max){
            flag1=1;
        }
    }
    for(int i=Max_place+1;i<=R;i++){
        if(All[i]+D<=Now_max){
            flag2=1;
        }
    }
    if(flag1 && flag2) return recrution(L,Max_place-1,D)+recrution(Max_place+1,R,D);
    else return 1;
}
int max_towers(int L,int R,int D){
    return recrution(L,R,D);
}

• 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