This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
ll n;
vector<ll>h;
void init(int N, vector<int> H)
{
n=N;
for(int i=0;i<N;i++)
h.pb(H[i]);
}
int max_towers(int L, int R, int D)
{
vector<pair<ll,ll>>v(n);
for(int i=L;i<=R;i++)
v[i]={1,h[i]};
for(int i=L;i<=R;i++)
{
ll maxi=h[i];
for(int j=i-1;j>=L;j--)
{
maxi=max(maxi,h[j]);
if(maxi-D>=h[j] && maxi-D>=h[i])
{
if(v[i].F<v[j].F+1)
v[i]={v[j].F+1,max(h[i],v[j].S)};
else if(v[i].F==v[j].F+1)
v[i].S=min(v[i].S,max(v[j].S,h[i]));
}
}
}
ll maxi=0;
for(int i=0;i<n;i++)
maxi=max(maxi,v[i].F);
return maxi;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |