代码

// luogu-judger-enable-o2
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
using namespace std;
int d[100100], n;
long long ans;
priority_queue <int, vector<int>, greater<int> > q;
inline int read()
{
	int x = 0;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		ch = getchar();
	while (ch >= '0' && ch <= '9')
		x = x * 10 + ch - '0', ch = getchar();
	return x;
}
int main()
{
//	freopen("road.in", "r", stdin);
//	freopen("road.out", "w", stdout);
	scanf("%d", &n);
	for (int i = 1;  i <= n; i++)
		d[i] = read();
	while(1)
	{
		bool flag = 1;
		int last = 1;
		for (int i = 1; i <= n + 1; i++)
		{
			if (d[i] == 0 && d[i - 1] == 0 && d[i + 1] == 0)
			{
				last = i + 1;
				continue;
			}
			if (d[i] != 0 && (d[i - 1] == 0 && d[i + 1] == 0))
			{
				ans += d[i];
				d[i] = 0;
				last = i + 1;
				continue;
			}
			if (d[i] != 0) flag = 0, q.push(d[i]);
			if (d[i] == 0 && last != i)
			{
				int del = q.top();
				ans += del;
				for (int j = last; j <= i; j++)
					if (d[j])
					d[j] -= del;
				last = i + 1;
				while(!q.empty())
				q.pop();
			}
		}
		if (flag)
			break;
	}
	printf("%lld", ans);
	return 0;
}//6 4 3 2 5 3 5

评测结果