제출 #595911

#제출 시각아이디문제언어결과실행 시간메모리
595911shrimb수열 (APIO14_sequence)C++17
71 / 100
2078 ms82144 KiB
#include"bits/stdc++.h" using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<class x> using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>; #define int long long #define endl '\n' #define mod 1000000007 //\ #define mod 1686876991 const int maxn = 100011; int n, k; int a[maxn]; int p[maxn]; vector<int> dpa(maxn), dpb(maxn); signed opts[202][maxn]; #define cost(l,r) ((p[r] - (l ? p[l - 1] : 0)) * (p[n-1] - p[r])) void rec (int l, int r, int lk, int rk, int j) { if (r < l) return; int m = (l + r) / 2; int opt = lk; dpb[m] = -1; for (int K = lk ; K <= min(rk, m) ; K++) { if ((K ? dpa[K - 1] : 0) + cost(K, m) > dpb[m]) { opt = K; dpb[m] = (K ? dpa[K - 1] : 0) + cost(K, m); } } opts[j][m] = opt; rec(l, m - 1, lk, opt, j); rec(m + 1, r, opt, rk, j); } signed main () { cin.tie(0)->sync_with_stdio(0); cin >> n >> k; for (int i = 0 ; i < n ; i++) { cin >> a[i]; p[i] = a[i]; if (i) p[i] += p[i-1]; } for (int i = 0 ; i < n ; i++) { dpa[i] = cost(0, i); } for (int i = 2 ; i <= k + 1 ; i++) { rec(i - 1, n - (k - i) - 2, i - 1, n - (k - i) - 2, i); swap(dpa, dpb); } cout << dpa[n-1] << endl; int i = k + 1; int j = n - 1; vector<int> v; while (i > 1) { v.push_back(opts[i][j]); j = opts[i][j] - 1; i--; } reverse(v.begin(), v.end()); for (int i : v) cout << i << " "; }

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp:14:1: warning: multi-line comment [-Wcomment]
   14 | //\
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...