// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define int long long
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;
// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);
void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }
inline char gc()
{
const static int SZ = 1 << 16;
static char buf[SZ], *p1, *p2;
if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
return -1;
return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
x = 0;
bool f = 0;
char c = gc();
while (!isdigit(c))
f ^= !(c ^ 45), c = gc();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
f && (x = -x), rd(y...);
}
template <typename T>
void prt(T x)
{
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
prt(x / 10);
putchar((x % 10) ^ 48);
}
const int N = 1e6 + 6;
int h[N], tr[N << 1];
vector<int> pl[N];
bool vd[N];
signed main()
{
int n;
rd(n);
for (int i = 1; i <= n; i++)
rd(h[i]), tr[i + n - 1] = h[i];
#define pul(x) tr[x] = min(tr[ls(x)], tr[rs(x)])
for (int i = n - 1; i > 0; i--)
pul(i);
auto cg = [&](int p, int v) -> void
{
p += n - 1, tr[p] = v;
for (p >>= 1; p; p >>= 1)
pul(p);
};
auto qy = [&](int l, int r) -> int
{
int mn = INF;
for (l += n - 1, r += n - 1; l <= r; l >>= 1, r >>= 1)
{
if (l & 1)
tmin(mn, tr[l++]);
if (~r & 1)
tmin(mn, tr[r--]);
}
return mn;
};
for (int i = 1; i <= n; i++)
pl[h[i]].pb(i);
int vl = 1, vr = n;
set<int> st;
llt ans = 0;
for (int i = 1; i < N; i++)
{
for (int j : pl[i])
vd[j] = 1, st.insert(j), cg(j, INF);
while (vd[vl])
vl++;
while (vd[vr])
vr--;
bool fg = 0;
while (!st.empty() && vl > *st.begin())
st.erase(st.begin()), fg = 1;
while (!st.empty() && vr < *st.rbegin())
st.erase(prev(st.end())), fg = 1;
if (st.empty())
continue;
assert(!fg);
int num = size(st);
int v0 = qy(1, *st.begin()), v2 = qy(*st.rbegin(), n);
assert(v0 == h[*st.begin() - 1] && v2 == h[*st.rbegin() + 1]);
if (v0 > v2)
swap(v0, v2);
assert(v0 >= i + 1 && v0 != INF && v2 != INF);
if (num == 1)
{
ans += (v0 + v2) + i;
}
else
{
ans += 1ll * i * num;
assert(num <= n - 2);
ans += (1ll + i) * ((num << 1) - 3ll);
// int v1 = qy(*st.begin(), *st.rbegin());
assert(*st.rbegin() - *st.begin() + 1 == num);
// ans += (0ll + v0 + v2 + min(v0, v1));
ans += (v0 << 1) + v2;
}
}
prt(ans), putchar('\n');
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
26972 KB |
Output is correct |
| 2 |
Correct |
8 ms |
27116 KB |
Output is correct |
| 3 |
Correct |
8 ms |
26972 KB |
Output is correct |
| 4 |
Incorrect |
9 ms |
27228 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
