제출 #1022654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022654		JakobZorz	Radio Towers (IOI22_towers)	C++17	23 / 100	4074 ms	2644 KiB

towers

#include"towers.h"
#include<vector>
#include<iostream>
using namespace std;

vector<int>arr;

void init(int N,vector<int>H){
    arr=H;
}

int solve(vector<int>arr,int d){
    int n=(int)arr.size();
    int res=0;
    
    for(int i=0;i<n;i++){
        int mn=2e9;
        
        int mx1=0;
        for(int j=i;j>=0;j--){
            mx1=max(mx1,arr[j]);
            if(arr[j]<arr[i]){
                mn=min(mn,mx1);
                break;
            }
        }
        
        int mx2=0;
        for(int j=i;j<n;j++){
            mx2=max(mx2,arr[j]);
            if(arr[j]<arr[i]){
                mn=min(mn,mx2);
                break;
            }
        }
        
        res+=mn-arr[i]>=d;
    }
    
    return res;
}

int max_towers(int L,int R,int D){
    vector<int>arr2;
    for(int i=L;i<=R;i++)
        arr2.push_back(arr[i]);
    return solve(arr2,D);
}

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