#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; //constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; template void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } template void cinarray(vector& v) { rep(i, v.size())cin >> v[i]; } template void coutarray(vector& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 2; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } typedef long double ld; typedef pair LDP; const ld eps = 1e-8; const ld pi = acosl(-1.0); template void addv(vector& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 100005; bool isp[mn]; vector ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template auto prev_itr(set& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template auto next_itr(set& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair; int dx[4] = { 1,0,-1,0 }; int dy[4] = { 0,1,0,-1 }; //----------------------------------------- template struct BIT { private: vector node; int n; public: BIT(int n_) { n = n_; node.resize(n, 0); } //0-indexed void add(int a, T w) { for (int i = a; i < n; i |= i + 1)node[i] += w; } //[0,a) T sum(int a) { T ret = 0; for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i]; return ret; } //[a,b) T sum(int a, int b) { return sum(b) - sum(a); } }; int cost[3005][3005]; void solve() { int n; cin >> n; vector p(n); rep(i, n)cin >> p[i]; rep(i, n) { BIT bt(n + 1); int cur = 0; Rep(j, i, n) { cur += bt.sum(p[j], n + 1); bt.add(p[j], 1); cost[i][j + 1] = cur; } } vector ans; vector dp(n + 1, 0); for (int c = 1; c <= n; c++) { //cout << "? " << c << "\n"; //coutarray(dp); auto calc = [&](int i, int j) { int le = j; int ri = n + 1; while (ri - le > 1) { int mid = (le + ri) / 2; int c1 = dp[i] + cost[i][mid]; int c2 = dp[j] + cost[j][mid]; if (c1 >= c2) { ri = mid; } else { le = mid; } } return ri; }; vector ndp(n + 1, 0); set st; vector> er(n + 2); rep(i, n + 1) { //erase nonvalid while (er[i].size()) { int id = er[i].back(); er[i].pop_back(); if (st.count(id)) { st.erase(id); auto itrpre = prev_itr(st, id); auto itrnex = next_itr(st, id); if (itrpre != st.end() && itrnex != st.end()) { int le = *itrpre; int ri = *itrnex; int loc = calc(le, ri); chmax(loc, i); er[loc].push_back(ri); } } } //answer if (st.empty())ndp[i] = -mod; else { int id = *--st.end(); ndp[i] = dp[id] + cost[id][i]; } //add st.insert(i); auto itrpre = prev_itr(st, i); if (itrpre != st.end()) { int le = *itrpre; int ri = i; er[calc(le, ri)].push_back(ri); } } swap(dp, ndp); ans.push_back(dp[n]); } rep(i, ans.size()) { cout << cost[0][n] - ans[i] << "\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //init(); //while(true) //useexpr(); //int t; cin >> t; rep(i, t) solve(); return 0; }