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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define semicolon ;
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
int n,k;
ll x[100010];
bool dp[1010][1010];
inline bool able(ll sp)
{
vector<ll>v(n);
for(int i=0;i<n;i++)
v[i]=x[i]-sp*i*2;
int l=k,r=k;
ll lm=v[l],rm=v[r];
for(int i=0;i<n;i++)
{
while(l>0&&v[l-1]>=rm)
lm=max(lm,v[--l]);
while(r<n-1&&v[r-1]<=lm)
rm=min(rm,v[++r]);
}
if(r-l<n-1)
return 0;
lm=v[l=0];
rm=v[r=n-1];
for(int i=0;i<n;i++)
{
while(l<k&&v[l+1]>=rm)
lm=max(lm,v[++l]);
while(r>k&&v[r-1]<=lm)
rm=min(rm,v[--r]);
}
return l==r;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll t;
cin>>n>>k>>t;
k--;
for(int i=0;i<n;i++)
cin>>x[i];
ll s=0;
ll e=inf;
while(s<e)
{
ll m=s+e>>1;
if(able(m))
e=m;
else
s=m+1;
}
cout<<(s+t-1)/t<<endl;
return 0;
}
Compilation message (stderr)
sparklers.cpp: In function 'int main()':
sparklers.cpp:60:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
ll m=s+e>>1;
~^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |