제출 #30639

#제출 시각아이디문제언어결과실행 시간메모리
30639Nirjhor수열 (APIO14_sequence)C++14
0 / 100
0 ms1848 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int K = 205; const int N = 100005; struct line { int id; ll m, c; }; int n, k, ptr; ll a[N], f[K][N]; int pre[K][N]; vector <line> v[K]; stack <int> opts; bool bad (line i, line j, line k) { return (i.c - k.c) * (j.m - i.m) < (i.c - j.c) * (k.m - i.m); } void add (int at, line l) { v[at].push_back(l); while (v[at].size() >= 3 and bad(v[at][v[at].size() - 3], v[at][v[at].size() - 2], v[at][v[at].size() - 1])) { v[at].erase(v[at].end() - 2); } } line query (int at, ll x) { while (ptr < v[at].size() - 1 and v[at][ptr].m * x + v[at][ptr].c < v[at][ptr + 1].m * x + v[at][ptr + 1].c) { ++ptr; } return v[at][ptr]; } int main() { scanf("%d %d", &n, &k); for (int i = 1; i <= n; ++i) { scanf("%lld", a + i); a[i] += a[i - 1]; } for (int i = 1; i <= k; ++i) { ptr = 0; add(i - 1, {i, a[i], f[i - 1][i] - a[i] * a[i]}); for (int j = i + 1; j <= n; ++j) { line opt = query(i - 1, a[j]); f[i][j] = opt.m * a[j] + opt.c; pre[i][j] = opt.id; add(i - 1, {j, a[j], f[i - 1][j] - a[j] * a[j]}); } } printf("%lld\n", f[k][n]); for (int i = k, j = n; i; --i) { j = pre[i][j]; opts.push(j); } while (!opts.empty()) { printf("%d ", opts.top()); opts.pop(); } puts(""); return 0; }

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

sequence.cpp: In function 'line query(int, ll)':
sequence.cpp:33:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (ptr < v[at].size() - 1 and v[at][ptr].m * x + v[at][ptr].c < v[at][ptr + 1].m * x + v[at][ptr + 1].c) {
              ^
sequence.cpp: In function 'int main()':
sequence.cpp:40:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &k);
                         ^
sequence.cpp:42:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", a + i);
                         ^
#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...