#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 1010101
#define MAXS 500
#define INF 1000000020
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000003
struct node {
int mn;
int mn2;
int cnt;
int mnl, mnr;
node(int x = 0, int ind = 0) {
mnl = mnr = ind;
if (!~x) {
mn = mn2 = cnt = -1;
return;
}
mn = x;
mn2 = INF;
cnt = 1;
}
};
inline node operator+(node n1, node n2) {
if (!~n1.cnt) return n2;
if (!~n2.cnt) return n1;
node ret;
ret.mn = min(n1.mn, n2.mn);
ret.cnt = 0;
ret.mnl = INF;
ret.mnr = -INF;
if (ret.mn == n1.mn) ret.cnt += n1.cnt, ret.mnl = min(ret.mnl, n1.mnl), ret.mnr = max(ret.mnr, n1.mnr);
else ret.mn2 = min(ret.mn2, n1.mn);
if (ret.mn == n2.mn) ret.cnt += n2.cnt, ret.mnl = min(ret.mnl, n2.mnl), ret.mnr = max(ret.mnr, n2.mnr);
else ret.mn2 = min(ret.mn2, n2.mn);
ret.mn2 = min(ret.mn2, n1.mn2);
ret.mn2 = min(ret.mn2, n2.mn2);
return ret;
}
int N;
int H[MAX];
int ch[MAX];
namespace segtree {
int N;
node tree[MAX * 4];
int lazy[MAX * 4];
void init(int s, int e, int loc = 1) {
lazy[loc] = -1;
if (s == e) {
tree[loc] = node(H[s], s);
return;
}
int m = s + e >> 1;
init(s, m, loc * 2);
init(m + 1, e, loc * 2 + 1);
tree[loc] = tree[loc * 2] + tree[loc * 2 + 1];
}
inline void prop(int loc) {
for (auto c : { loc * 2, loc * 2 + 1 }) {
tree[c].mn = max(tree[c].mn, lazy[loc]);
lazy[c] = max(lazy[c], lazy[loc]);
assert(tree[c].mn < tree[c].mn2);
}
lazy[loc] = -1;
}
inline void upd(int s, int e, int l, int r, int v, int loc = 1) {
if (s != e) prop(loc);
if (e < l || r < s) return;
if (l <= s && e <= r) {
if (v < tree[loc].mn2) {
if (v > tree[loc].mn) {
tree[loc].mn = v;
lazy[loc] = max(lazy[loc], v);
}
return;
}
}
int m = s + e >> 1;
upd(s, m, l, r, v, loc * 2);
upd(m + 1, e, l, r, v, loc * 2 + 1);
tree[loc] = tree[loc * 2] + tree[loc * 2 + 1];
}
void upd(int low, int r, int v) { upd(1, N, low, r, v); }
inline node query(int s, int e, int l, int r, int loc = 1) {
if (s != e) prop(loc);
if (e < l || r < s) return node(-1);
if (l <= s && e <= r) return tree[loc];
int m = s + e >> 1;
return query(s, m, l, r, loc * 2) + query(m + 1, e, l, r, loc * 2 + 1);
}
inline node query(int l, int r) { return query(1, N, l, r); }
}
inline ll rsum(ll n) { return (n * (n + 1) / 2) % MOD; }
inline ll rsum(ll l, ll r) { return rsum(r) - rsum(l - 1); }
namespace minseg {
int tree[MAX * 4];
void init(int s, int e, int loc = 1) {
if (s == e) {
tree[loc] = H[s];
return;
}
int m = s + e >> 1;
init(s, m, loc * 2);
init(m + 1, e, loc * 2 + 1);
tree[loc] = min(tree[loc * 2], tree[loc * 2 + 1]);
}
inline void prop(int loc) { for (auto c : { loc * 2, loc * 2 + 1 }) tree[c] = min(tree[c], tree[loc]); }
inline void upd(int s, int e, int l, int r, int x, int loc = 1) {
if (s != e) prop(loc);
if (e < l || r < s) return;
if (l <= s && e <= r) tree[loc] = min(tree[loc], x);
int m = s + e >> 1;
upd(s, m, l, r, x, loc * 2);
upd(m + 1, e, l, r, loc * 2 + 1);
tree[loc] = min(tree[loc * 2], tree[loc * 2 + 1]);
}
inline void upd(int l, int r, int x) { upd(1, N, l, r, x); }
inline int get(int s, int e, int i, int loc = 1) {
if (s != e) prop(loc);
if (e < i || i < s) return INF;
if (s == e) return tree[loc];
int m = s + e >> 1;
return min(get(s, m, i, loc * 2), get(m + 1, e, i, loc * 2 + 1));
}
inline int get(int i) { return get(1, N, i); }
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> N;
segtree::N = N;
int i;
ll ans = 0;
int mv = 1;
for (i = 1; i <= N; i++) cin >> H[i];
for (i = 1; i <= N; i++) if (H[mv] < H[i]) mv = i;
for (i = 1; i <= N; i++) ch[i] = H[i];
for (i = 1; i <= mv; i++) ch[i] = max(ch[i], ch[i - 1]);
for (i = N; i >= mv; i--) ch[i] = max(ch[i], ch[i + 1]);
for (i = 1; i <= N; i++) ans += rsum(H[i], ch[i] - 1), ans %= MOD;
segtree::init(1, N);
minseg::init(1, N);
int low, high;
low = high = -1;
for (i = 1; i < N; i++) if (H[i] > H[i + 1]) {
low = i;
break;
}
if (!~low) {
cout << 0 << ln;
return 0;
}
for (i = N; i > 1; i--) if (H[i] > H[i - 1]) {
high = i;
break;
}
if (!~high) {
cout << 0 << ln;
return 0;
}
if (low >= high) {
cout << 0 << ln;
return 0;
}
set<int> lst, rst;
for (i = 1; i <= low; i++) lst.insert(H[i]);
for (i = high; i <= N; i++) rst.insert(H[i]);
int rot = 0;
while (low < high) {
rot++;
assert(rot <= N * 10);
while (low < N && minseg::get(low) <= minseg::get(low + 1)) low++, lst.insert(H[low]);
while (high > 1 && minseg::get(high) <= minseg::get(high - 1)) high--, rst.insert(H[high]);
if (low >= high) break;
auto res = segtree::query(low + 1, high - 1);
int mn = res.mn;
int n = res.cnt;
auto itl = lst.upper_bound(mn);
auto itr = rst.upper_bound(mn);
int up = min(res.mn2, min(*itl, *itr));
int ml = min(*itl, segtree::query(low, res.mnl).mn2);
int mr = min(*itr, segtree::query(res.mnr, high).mn2);
if (res.cnt == 1) {
ans += 1ll * (ml + mr) * (up - mn);
segtree::upd(low, high, up);
minseg::upd(low, high, up);
ans %= MOD;
continue;
}
ans += rsum(mn + 1, up) * (n * 2 - 3);
ans %= MOD;
ans += 1ll * (0ll + up + ml + mr) * (up - mn);
ans %= MOD;
segtree::upd(low, high, up);
minseg::upd(low, high, up);
}
ans %= MOD;
if (ans < 0) ans += MOD;
cout << ans << ln;
}
Compilation message
Main.cpp: In function 'void segtree::init(int, int, int)':
Main.cpp:63:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
63 | int m = s + e >> 1;
| ~~^~~
Main.cpp: In function 'void segtree::upd(int, int, int, int, int, int)':
Main.cpp:88:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
88 | int m = s + e >> 1;
| ~~^~~
Main.cpp: In function 'node segtree::query(int, int, int, int, int)':
Main.cpp:98:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
98 | int m = s + e >> 1;
| ~~^~~
Main.cpp: In function 'void minseg::init(int, int, int)':
Main.cpp:112:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
112 | int m = s + e >> 1;
| ~~^~~
Main.cpp: In function 'void minseg::upd(int, int, int, int, int, int)':
Main.cpp:122:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
122 | int m = s + e >> 1;
| ~~^~~
Main.cpp: In function 'int minseg::get(int, int, int, int)':
Main.cpp:132:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
132 | int m = s + e >> 1;
| ~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
35 ms |
79300 KB |
Output is correct |
| 2 |
Incorrect |
41 ms |
79360 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
