제출 #626908

#제출 시각아이디문제언어결과실행 시간메모리
626908kkkkkkkk송신탑 (IOI22_towers)C++17
0 / 100
4059 ms1436 KiB

#include <bits/stdc++.h>

using namespace std;

vector<int> height;
int N,k=0;

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

int max_towers(int l,int r,int d)
{
    int res=1;
    for (int i=l;i<=r;i++)
    {
        int max_height=0,how_many=1;
        for (int j=i+1;j<=r;j++)
        {
            max_height=max(max_height,height[j]);
            if (max_height-height[j]>=d&&max_height-height[i]>=d)
                how_many++;
        }
        res=max(res,how_many);
    }
    return res;
}
#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...