English
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <chrono>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <climits>
#include <stack>
#include <valarray>
#include <random>
#include <bitset>
#include <numeric>
#include <iomanip>
#include <cassert>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;
template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}
template<typename T> bool ckmax(T& a, const T& b){return b>a?a=b,1:0;}
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(char c) {
return string(1, c);
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#include <algorithm>
#include <cassert>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
constexpr int bsf_constexpr(unsigned int n) {
int x = 0;
while (!(n & (1 << x))) x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) const {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) const {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() const { return d[1]; }
template <bool (*f)(S)> int max_right(int l) const {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) const {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) const {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) const {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
#include <cassert>
#include <vector>
#include <cassert>
#include <numeric>
#include <type_traits>
namespace atcoder {
namespace internal {
#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;
template <class T>
using is_integral = typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;
#else
template <class T> using is_integral = typename std::is_integral<T>;
template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<is_signed_int<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type;
#endif
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace atcoder
namespace atcoder {
// Reference: https://en.wikipedia.org/wiki/Fenwick_tree
template <class T> struct fenwick_tree {
using U = internal::to_unsigned_t<T>;
public:
fenwick_tree() : _n(0) {}
explicit fenwick_tree(int n) : _n(n), data(n) {}
void add(int p, T x) {
assert(0 <= p && p < _n);
p++;
while (p <= _n) {
data[p - 1] += U(x);
p += p & -p;
}
}
T sum(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
return sum(r) - sum(l);
}
private:
int _n;
std::vector<U> data;
U sum(int r) {
U s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
};
} // namespace atcoder
using namespace atcoder;
// using mint = modint998244353; // modint1000000007;
// typedef vector<mint> vmi;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use rng() to get unsigned int
// mt19937_64 for random long longs
const int inf = 1e9;
int minop(int a, int b) {
return min(a, b);
}
int maxop(int a, int b) {
return max(a, b);
}
int max_e() {
return -inf;
}
int min_e() {
return inf;
}
const int N = 2e5+1, P = 4*N;
int q; vector<int> g[P];
inline pair<int,int> next(int i, int s, int t) { return {(i<<1)+1,(s+t)>>1}; }
void add(int l, int r, int i = 0, int s = 0, int t = N-1) {
if (g[i].push_back(r), s != t) {
const auto p = next(i,s,t);
if (l > p.second)
add(l, r, p.first+1,p.second+1,t);
else
add(l, r, p.first,s,p.second);
}
}
int query(int l, int r, int u, int v, int i = 0, int s = 0, int t = N-1) {
if (s >= l and t <= r)
return upper_bound(all(g[i]),v)-lower_bound(all(g[i]),u);
if (s > r or t < l)
return 0;
const auto p = next(i,s,t);
return query(l, r, u, v, p.first,s,p.second)+query(l, r, u, v, p.first+1,p.second+1,t);
}
void solve() {
int n;
cin >> n;
vi p(n);
rep(i, 0, n) {
cin >> p[i];
--p[i];
add(i, p[i]);
}
rep(i, 0, P) {
if (sz(g[i]) > 1) {
sort(all(g[i]));
}
}
vi afterCnt(n), afterMaxIdx(n), afterMinIdx(n); // how many after, furthest after
vi beforeCnt(n), beforeMinIdx(n), beforeMaxIdx(n); // how many before, how many before
// lets compute for each item how many after
fenwick_tree<int> fwmax(n), fwmin(n);
segtree<int, maxop, max_e> segMax(n), idxMax(n);
segtree<int, minop, min_e> segMin(n), idxMin(n);
rep(i, 0, n) {
afterCnt[i] = fwmax.sum(p[i], n);
afterMaxIdx[i] = p[i]; // up
afterMinIdx[i] = i; // down
if (afterCnt[i]) {
afterMaxIdx[i] = segMax.prod(p[i], n);
afterMinIdx[i] = idxMin.prod(p[i], n);
}
fwmax.add(p[i], 1);
segMax.set(p[i], p[i]);
idxMin.set(p[i], i);
}
debug(afterCnt);
debug(afterMaxIdx);
debug(afterMinIdx);
ford(i, n, 0) {
beforeCnt[i] = fwmin.sum(0, p[i]);
beforeMinIdx[i] = p[i];
beforeMaxIdx[i] = i;
if (beforeCnt[i]) {
beforeMinIdx[i] = segMin.prod(0, p[i]);
beforeMaxIdx[i] = idxMax.prod(0, p[i]);
}
fwmin.add(p[i], 1);
segMin.set(p[i], p[i]);
idxMax.set(p[i], i);
}
debug(beforeCnt);
debug(beforeMinIdx);
debug(beforeMaxIdx);
// ready to count
segtree<int, maxop, max_e> upMax(n), downMax(n);
segtree<int, minop, min_e> upMin(n), downMin(n);
rep(i, 0, n) {
downMax.set(i, p[i]);
downMin.set(i, p[i]);
upMin.set(p[i], i);
upMax.set(p[i], i);
}
vector<ll> res(n);
int steps = 0;
rep(i, 0, n) {
debug("solving for: ", i);
int alr = 1;
// perform first move
int atDist = beforeCnt[i] + afterCnt[i];
res[i] += atDist;
if (atDist == 0) continue;
alr += atDist;
int ulbound = beforeMinIdx[i];
int urbound = afterMaxIdx[i];
int dlbound = afterMinIdx[i];
int drbound = beforeMaxIdx[i];
debug("found at 1: ", atDist, ulbound, urbound, dlbound, drbound);
// now widen it
// we know that alr lie in: [dlbound;drbound] x [ulbound;urbound]
int dist = 2;
while (true) {
int ulength = urbound - ulbound + 1;
int dlength = drbound - dlbound + 1;
if (ulength == dlength && ulength == alr) {
break;
}
++steps;
debug("considering bounds: ", dlbound, drbound, ulbound, urbound, alr);
// new_items !!!
int q = query(dlbound, drbound, ulbound, urbound);
int new_within = q - alr;
int new_items = ulength + dlength - 2 * q;
res[i] += (ll)(new_items + new_within) * dist;
alr += new_items + new_within;
int ndlbound = upMin.prod(ulbound, urbound + 1);
int ndrbound = upMax.prod(ulbound, urbound + 1);
int nulbound = downMin.prod(dlbound, drbound + 1);
int nurbound = downMax.prod(dlbound, drbound + 1);
dlbound = ndlbound;
drbound = ndrbound;
ulbound = nulbound;
urbound = nurbound;
++dist;
}
}
// cout << steps << endl;
// cout << n << endl;
rep(i, 0, n) {
cout << res[i] << ' ';
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int t;
// cin >> t;
t = 1;
while (t--) {
solve();
}
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 | #include <cstdio> #include <iostream> #include <algorithm> #include <cstring> #include <vector> #include <set> #include <map> #include <array> #include <random> #include <cmath> #include <chrono> #include <list> #include <ctime> #include <sstream> #include <queue> #include <climits> #include <stack> #include <valarray> #include <random> #include <bitset> #include <numeric> #include <iomanip> #include <cassert> using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef long long ll; #define rep(x, b, e) for(int x=(b); x<(e); ++x) #define trav(a, x) for(auto& a : x) #define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x) #define all(c) c.begin(),c.end() #define sz(x) ((int)((x).size())) #define pb push_back #define eb emplace_back #define st first #define nd second #define mp(x,y) make_pair(x,y) typedef short int sint; template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;} template<typename T> bool ckmax(T& a, const T& b){return b>a?a=b,1:0;} template <typename A, typename B> string to_string(pair<A, B> p); template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p); template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p); string to_string(const string& s) { return '"' + s + '"'; } string to_string(char c) { return string(1, c); } string to_string(const char* s) { return to_string((string) s); } string to_string(bool b) { return (b ? "true" : "false"); } string to_string(vector<bool> v) { bool first = true; string res = "{"; for (int i = 0; i < static_cast<int>(v.size()); i++) { if (!first) { res += ", "; } first = false; res += to_string(v[i]); } res += "}"; return res; } template <size_t N> string to_string(bitset<N> v) { string res = ""; for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); } return res; } template <typename A> string to_string(A v) { bool first = true; string res = "{"; for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); } res += "}"; return res; } template <typename A, typename B> string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; } template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #include <algorithm> #include <cassert> #include <vector> #ifdef _MSC_VER #include <intrin.h> #endif namespace atcoder { namespace internal { // @param n `0 <= n` // @return minimum non-negative `x` s.t. `n <= 2**x` int ceil_pow2(int n) { int x = 0; while ((1U << x) < (unsigned int)(n)) x++; return x; } // @param n `1 <= n` // @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0` constexpr int bsf_constexpr(unsigned int n) { int x = 0; while (!(n & (1 << x))) x++; return x; } // @param n `1 <= n` // @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0` int bsf(unsigned int n) { #ifdef _MSC_VER unsigned long index; _BitScanForward(&index, n); return index; #else return __builtin_ctz(n); #endif } } // namespace internal } // namespace atcoder namespace atcoder { template <class S, S (*op)(S, S), S (*e)()> struct segtree { public: segtree() : segtree(0) {} explicit segtree(int n) : segtree(std::vector<S>(n, e())) {} explicit segtree(const std::vector<S>& v) : _n(int(v.size())) { log = internal::ceil_pow2(_n); size = 1 << log; d = std::vector<S>(2 * size, e()); for (int i = 0; i < _n; i++) d[size + i] = v[i]; for (int i = size - 1; i >= 1; i--) { update(i); } } void set(int p, S x) { assert(0 <= p && p < _n); p += size; d[p] = x; for (int i = 1; i <= log; i++) update(p >> i); } S get(int p) const { assert(0 <= p && p < _n); return d[p + size]; } S prod(int l, int r) const { assert(0 <= l && l <= r && r <= _n); S sml = e(), smr = e(); l += size; r += size; while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1; r >>= 1; } return op(sml, smr); } S all_prod() const { return d[1]; } template <bool (*f)(S)> int max_right(int l) const { return max_right(l, [](S x) { return f(x); }); } template <class F> int max_right(int l, F f) const { assert(0 <= l && l <= _n); assert(f(e())); if (l == _n) return _n; l += size; S sm = e(); do { while (l % 2 == 0) l >>= 1; if (!f(op(sm, d[l]))) { while (l < size) { l = (2 * l); if (f(op(sm, d[l]))) { sm = op(sm, d[l]); l++; } } return l - size; } sm = op(sm, d[l]); l++; } while ((l & -l) != l); return _n; } template <bool (*f)(S)> int min_left(int r) const { return min_left(r, [](S x) { return f(x); }); } template <class F> int min_left(int r, F f) const { assert(0 <= r && r <= _n); assert(f(e())); if (r == 0) return 0; r += size; S sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(op(d[r], sm))) { while (r < size) { r = (2 * r + 1); if (f(op(d[r], sm))) { sm = op(d[r], sm); r--; } } return r + 1 - size; } sm = op(d[r], sm); } while ((r & -r) != r); return 0; } private: int _n, size, log; std::vector<S> d; void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); } }; } // namespace atcoder #include <cassert> #include <vector> #include <cassert> #include <numeric> #include <type_traits> namespace atcoder { namespace internal { #ifndef _MSC_VER template <class T> using is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value || std::is_same<T, __int128>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value || std::is_same<T, unsigned __int128>::value, std::true_type, std::false_type>::type; template <class T> using make_unsigned_int128 = typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>; template <class T> using is_integral = typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using is_signed_int = typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) || is_signed_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int = typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type; template <class T> using to_unsigned = typename std::conditional< is_signed_int128<T>::value, make_unsigned_int128<T>, typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>, std::common_type<T>>::type>::type; #else template <class T> using is_integral = typename std::is_integral<T>; template <class T> using is_signed_int = typename std::conditional<is_integral<T>::value && std::is_signed<T>::value, std::true_type, std::false_type>::type; template <class T> using is_unsigned_int = typename std::conditional<is_integral<T>::value && std::is_unsigned<T>::value, std::true_type, std::false_type>::type; template <class T> using to_unsigned = typename std::conditional<is_signed_int<T>::value, std::make_unsigned<T>, std::common_type<T>>::type; #endif template <class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>; template <class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>; template <class T> using to_unsigned_t = typename to_unsigned<T>::type; } // namespace internal } // namespace atcoder namespace atcoder { // Reference: https://en.wikipedia.org/wiki/Fenwick_tree template <class T> struct fenwick_tree { using U = internal::to_unsigned_t<T>; public: fenwick_tree() : _n(0) {} explicit fenwick_tree(int n) : _n(n), data(n) {} void add(int p, T x) { assert(0 <= p && p < _n); p++; while (p <= _n) { data[p - 1] += U(x); p += p & -p; } } T sum(int l, int r) { assert(0 <= l && l <= r && r <= _n); return sum(r) - sum(l); } private: int _n; std::vector<U> data; U sum(int r) { U s = 0; while (r > 0) { s += data[r - 1]; r -= r & -r; } return s; } }; } // namespace atcoder using namespace atcoder; // using mint = modint998244353; // modint1000000007; // typedef vector<mint> vmi; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use rng() to get unsigned int // mt19937_64 for random long longs const int inf = 1e9; int minop(int a, int b) { return min(a, b); } int maxop(int a, int b) { return max(a, b); } int max_e() { return -inf; } int min_e() { return inf; } const int N = 2e5+1, P = 4*N; int q; vector<int> g[P]; inline pair<int,int> next(int i, int s, int t) { return {(i<<1)+1,(s+t)>>1}; } void add(int l, int r, int i = 0, int s = 0, int t = N-1) { if (g[i].push_back(r), s != t) { const auto p = next(i,s,t); if (l > p.second) add(l, r, p.first+1,p.second+1,t); else add(l, r, p.first,s,p.second); } } int query(int l, int r, int u, int v, int i = 0, int s = 0, int t = N-1) { if (s >= l and t <= r) return upper_bound(all(g[i]),v)-lower_bound(all(g[i]),u); if (s > r or t < l) return 0; const auto p = next(i,s,t); return query(l, r, u, v, p.first,s,p.second)+query(l, r, u, v, p.first+1,p.second+1,t); } void solve() { int n; cin >> n; vi p(n); rep(i, 0, n) { cin >> p[i]; --p[i]; add(i, p[i]); } rep(i, 0, P) { if (sz(g[i]) > 1) { sort(all(g[i])); } } vi afterCnt(n), afterMaxIdx(n), afterMinIdx(n); // how many after, furthest after vi beforeCnt(n), beforeMinIdx(n), beforeMaxIdx(n); // how many before, how many before // lets compute for each item how many after fenwick_tree<int> fwmax(n), fwmin(n); segtree<int, maxop, max_e> segMax(n), idxMax(n); segtree<int, minop, min_e> segMin(n), idxMin(n); rep(i, 0, n) { afterCnt[i] = fwmax.sum(p[i], n); afterMaxIdx[i] = p[i]; // up afterMinIdx[i] = i; // down if (afterCnt[i]) { afterMaxIdx[i] = segMax.prod(p[i], n); afterMinIdx[i] = idxMin.prod(p[i], n); } fwmax.add(p[i], 1); segMax.set(p[i], p[i]); idxMin.set(p[i], i); } debug(afterCnt); debug(afterMaxIdx); debug(afterMinIdx); ford(i, n, 0) { beforeCnt[i] = fwmin.sum(0, p[i]); beforeMinIdx[i] = p[i]; beforeMaxIdx[i] = i; if (beforeCnt[i]) { beforeMinIdx[i] = segMin.prod(0, p[i]); beforeMaxIdx[i] = idxMax.prod(0, p[i]); } fwmin.add(p[i], 1); segMin.set(p[i], p[i]); idxMax.set(p[i], i); } debug(beforeCnt); debug(beforeMinIdx); debug(beforeMaxIdx); // ready to count segtree<int, maxop, max_e> upMax(n), downMax(n); segtree<int, minop, min_e> upMin(n), downMin(n); rep(i, 0, n) { downMax.set(i, p[i]); downMin.set(i, p[i]); upMin.set(p[i], i); upMax.set(p[i], i); } vector<ll> res(n); int steps = 0; rep(i, 0, n) { debug("solving for: ", i); int alr = 1; // perform first move int atDist = beforeCnt[i] + afterCnt[i]; res[i] += atDist; if (atDist == 0) continue; alr += atDist; int ulbound = beforeMinIdx[i]; int urbound = afterMaxIdx[i]; int dlbound = afterMinIdx[i]; int drbound = beforeMaxIdx[i]; debug("found at 1: ", atDist, ulbound, urbound, dlbound, drbound); // now widen it // we know that alr lie in: [dlbound;drbound] x [ulbound;urbound] int dist = 2; while (true) { int ulength = urbound - ulbound + 1; int dlength = drbound - dlbound + 1; if (ulength == dlength && ulength == alr) { break; } ++steps; debug("considering bounds: ", dlbound, drbound, ulbound, urbound, alr); // new_items !!! int q = query(dlbound, drbound, ulbound, urbound); int new_within = q - alr; int new_items = ulength + dlength - 2 * q; res[i] += (ll)(new_items + new_within) * dist; alr += new_items + new_within; int ndlbound = upMin.prod(ulbound, urbound + 1); int ndrbound = upMax.prod(ulbound, urbound + 1); int nulbound = downMin.prod(dlbound, drbound + 1); int nurbound = downMax.prod(dlbound, drbound + 1); dlbound = ndlbound; drbound = ndrbound; ulbound = nulbound; urbound = nurbound; ++dist; } } // cout << steps << endl; // cout << n << endl; rep(i, 0, n) { cout << res[i] << ' '; } cout << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int t; // cin >> t; t = 1; while (t--) { solve(); } } |