제출 #697621

#제출 시각아이디문제언어결과실행 시간메모리
697621tamthegod수열 (APIO14_sequence)C++17
71 / 100
101 ms16568 KiB
// Make the best become better // No room for laziness #include<bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 1e4 + 5; const int maxK = 205; const int mod = 1e9 + 7; const ll oo = 1e18; int n, k, a[maxN], sum[maxN]; int f[maxN][maxK]; void ReadInput() { cin >> n >> k; for(int i=1; i<=n; i++) { cin >> a[i]; sum[i] = sum[i - 1] + a[i]; } } int get(int l, int r) { if(l > r) return 0; return sum[r] - sum[l - 1]; } int t = 0; void DnC(int l, int r, int optl, int optr) { if(l > r) return; int mid = (l + r) / 2; int res = -oo, id = -1; for(int i=optl; i<=min(mid, optr); i++) { int cost = f[i - 1][t - 1] + get(i, mid) * get(mid + 1, n); if(res < cost) { res = cost; id = i; } } f[mid][t] = res; DnC(l, mid - 1, optl, id); DnC(mid + 1, r, id, optr); } void Solve() { //cout << get(1, n);return memset(f, -3, sizeof f); f[0][0] = 0; for(int i=1; i<=k; i++) { t++; DnC(1, n, 1, n); } int res = -1; int id = 0; for(int i=k; i<n; i++) { if(res < f[i][k]) { res = f[i][k]; id = i; } } cout << res << '\n'; int tmp = res; vector<int> trace; trace.pb(id); for(int i=id-1; i>=1; i--) { if(f[i][k - 1] + get(i + 1, id) * get(id + 1, n) == res) { trace.pb(i); id = i; res = f[i][k - 1]; k--; } } reverse(trace.begin(), trace.end()); for(int v : trace) cout << v << " "; } int32_t main() { //freopen("sol.inp", "r", stdin); // freopen("sol.out", "w", stdout); ios_base::sync_with_stdio(false); cin.tie(nullptr); ReadInput(); Solve(); }

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

sequence.cpp: In function 'void Solve()':
sequence.cpp:74:9: warning: unused variable 'tmp' [-Wunused-variable]
   74 |     int tmp = res;
      |         ^~~
#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...