[堆 折线] Codeforces713C. Sonya and Problem Wihtout a Legend

CF题解
很妙啊

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

typedef long long ll;

const int N=3010;

int n,c;
ll ans;

priority_queue<int> Q;

int main(){
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
  scanf("%d",&n);
  for(int i=1;i<=n;i++){
    scanf("%d",&c); c-=i;
    Q.push(c);
    if(Q.top()>c)
      ans+=Q.top()-c,Q.pop(),Q.push(c);
  }
  cout<<ans<<endl;
  return 0;
}