mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-04 19:06:27 +00:00
C - Sonya and Problem Wihtout a Legend
https://codeforces.com/contest/713/submission/188408984
This commit is contained in:
parent
1bbe5af4cb
commit
fb4c5d18ef
35
Codeforces/713/C/C.cpp
Normal file
35
Codeforces/713/C/C.cpp
Normal file
@ -0,0 +1,35 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <queue>
|
||||||
|
|
||||||
|
using std::cin;
|
||||||
|
using std::cout;
|
||||||
|
const char endl = '\n';
|
||||||
|
|
||||||
|
const int N = 1e6 + 5;
|
||||||
|
|
||||||
|
int n;
|
||||||
|
long long ans;
|
||||||
|
std::priority_queue<long long> q;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
std::ios::sync_with_stdio(false);
|
||||||
|
cin.tie(nullptr);
|
||||||
|
|
||||||
|
cin >> n;
|
||||||
|
|
||||||
|
for (int i = 1, x; i <= n; i++) {
|
||||||
|
cin >> x;
|
||||||
|
|
||||||
|
q.emplace(x - i);
|
||||||
|
|
||||||
|
if (q.top() > x - i) {
|
||||||
|
ans += q.top() - (x - i);
|
||||||
|
q.pop();
|
||||||
|
q.emplace(x - i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
cout << ans << endl;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user