分析:
学会了前置题目,我们来看这道题:
首先,这个数组a前后两段要操作的次数是一定的;
贪心的想,要让操作数最小,我们要加的数就要大一点,等差数列越往后越大;
所以我们可以对a从后往前操作:
从后往前遍历,如果a[i] < b[i],说明我们需要加上等差数列;
等差数列的范围:[i-k+1,i],首项为1,公差为1;
我们发现当a[i]比较小的时候,要加多次才能>=b[i];
具体的次数就是:cnt = (b[i]-a[i])/k + ((b[i]-a[i])%k ? 1 : 0);
众所周知(手模),等差数列具有可加性,所以所加的等差数列就变成了:
范围:[i-k+1,i],首项为cnt,公差为cnt;
并且每次要查询a[i],即单点查询;
所以这些问题 前置题目 就能完美的解决;(套个板子就行)
然后可以发现当i-k+1 < 1时,我们每次只能增加的等差数列的范围是[1,k];
那么此时的次数就取决于剩下的>b[i]的数中,所需要加的最大次数,算一下就行。
代码:
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
// #include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double> > PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 3e5 + 7;
const int N = 1e6 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
int n,k;
ll b[maxn];
ll d[maxn]; //差分数组
struct node
{
int l,r;
ll sum;
ll add; //懒标记
}tr[maxn * 4];
void pushup(int u)
{
tr[u].sum = tr[u<<1].sum + tr[u<<1|1].sum;
}
void pushdown(int u) //懒标记下传
{
if(tr[u].add != 0)
{
tr[u<<1].add += tr[u].add;
tr[u<<1].sum += (tr[u<<1].r - tr[u<<1].l + 1) * tr[u].add;
tr[u<<1|1].add += tr[u].add;
tr[u<<1|1].sum += (tr[u<<1|1].r - tr[u<<1|1].l + 1) * tr[u].add;
tr[u].add = 0;
}
}
void build(int u,int l,int r) //建树
{
if(l == r)
{
tr[u] = {l,r,0,0};
return;
}
tr[u] = {l,r};
int mid = l + r >> 1;
build(u<<1, l, mid);
build(u<<1|1, mid+1, r);
pushup(u);
}
void update(int u,int l,int r,ll v)
{
if(l > r) return;
if(tr[u].l >= l && tr[u].r <= r)
{
//注意add是没有包括自己区间的哦
tr[u].sum += (tr[u].r - tr[u].l + 1) * v;
tr[u].add += v;
return;
}
pushdown(u); //分裂了,下传懒标记
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) update(u<<1, l, r, v);
if(r > mid) update(u<<1|1, l, r, v);
pushup(u); //向上更新
}
ll query(int u,int l,int r) //区间查询
{
if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
pushdown(u); //分裂了,下传懒标记
int mid = tr[u].l + tr[u].r >> 1;
ll sum = 0;
if(l <= mid) sum += query(u<<1, l, r);
if(r > mid) sum += query(u<<1|1, l, r);
return sum;
}
void print()
{
for(int i=1;i<=n;i++) cout<<query(1,1,i)<<' ';
cout<<'\n';
}
void solve()
{
iire(n,k);
for(int i=1;i<=n;i++) scanf("%lld",&b[i]);
// for(int i=n;i>=1;i--) d[i] = b[i] - b[i-1];
// d[1] = 0;
build(1,1,n);
ll ans = 0;
for(int i=n;i-k+1>=1;i--)
{
ll num = query(1,1,i);
if(num < b[i]) //[i-k+1 , i]加上等差数列
{
ll cha = b[i] - num;
ll cnt = cha/k + (cha%k ? 1 : 0); //加了几次
ans += cnt;
// cout<<cnt<<'\n';
ll x = cnt; //首项
ll dd = cnt; //公差
int l = i-k+1;
int r = i;
update(1,l,l,x);
update(1,l+1,r,dd);
if(r+1 <= n) update(1,r+1,r+1,-x+(dd*(r-l)));
}
}
// print();
ll mx = 0;
for(int i=1;i<=n;i++)
{
ll num = query(1,1,i);
if(num < b[i])
{
ll cha = b[i] - num;
mx = max(mx, cha/i + (cha%i ? 1 : 0));
}
}
ans += mx;
cout<<ans<<'\n';
}
int main()
{
int t;
// ire(t);
t = 1;
while(t--)
{
solve();
}
return 0;
}