Submission #2278000

---

Source Code Expand

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum[100001], last, cnt, ans,a[101000];
struct Edge { LL to, cost; };
string str;
bool f;
vector<Edge>vec[1000];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
int main() {
	cin >> n;
	rep(i, n) {
		cin >> a[i];
	}
		a[n] = 0;
	LL mx = 0;
	Tll carp = Tll{0,0,0};
	do {
		stack<Pll>st;
		mx = 0;
		f = 0;
		LL ss = 0;
		rep(i, n+1) {
			ss += sum[i];
			if (sum[i + 1] == 0) {
				while (!st.empty()) {
					Pll now = st.top();
					if (now.fir <= a[i]) break;
					st.pop();
					if (mx < (i - now.sec)*(now.fir-ss)) {
						mx = (i - now.sec)*(now.fir-ss);
						carp = Tll{ now.sec, i, now.fir };
					}
				}
				if (st.empty()&&mx!=0) {
					f = 1;
					ans++;
					sum[carp.fir] += carp.third;
					sum[carp.sec + 1] -= carp.third;
					mx = 0;
				}
				if ((st.empty()?1:st.top().fir < a[i]&&a[i]>0))
					st.push(Pll(a[i], i));
			}
			else {
				while (!st.empty()) {
					Pll now = st.top();
					st.pop();
					if (mx < (i - now.sec)*(now.fir-ss)) {
						mx = (i - now.sec)*(now.fir-ss);
						carp = Tll{ now.sec, i, now.fir };
					}
				}
				if (mx != 0) {
					f = 1;
					ans++;
					sum[carp.fir] += carp.third-ss;
					sum[carp.sec + 1] -= carp.third-ss;
					mx = 0;
				}
			}
		}
	} while (f == 1);
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result