제출 #109772

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109772		PeppaPig	수열 (APIO14_sequence)	C++14	0 / 100	116 ms	82068 KiB

sequence

#include <bits/stdc++.h>
 
#define long long long
 
using namespace std;
 
const int N = 1e5+5;
 
struct line {
    long m, b;
    int idx;
    line() { }
    line(long m, long b, int idx) : m(m), b(b), idx(idx) { }
    long f(long x) { return m * x + b; }
};
 
struct cht {
    int ptr = 0, sz = 0;
    line l[N];
    bool bad(line a, line b, line c) { return (c.b - a.b) * (a.m - b.m) <= (b.b - a.b) * (a.m - c.m); }
    void add(long m, long b, int idx) {
        line now(m, b, idx);
        while(sz > 1 && bad(l[sz-2], l[sz-1], now)) --sz;
        l[++sz] = now;
    }
    line query(long x) {
        if(ptr >= sz) ptr = sz - 1;
        while(ptr + 1 < sz && l[ptr].f(x) < l[ptr+1].f(x)) ++ptr;
        return l[ptr];
    }
    void clear() { sz = 0, ptr = 0; }
} hull[2];
 
int n, k, pv[N][205];
long dp[N], pref[N];
 
int main() {
    scanf("%d %d", &n, &k), ++k;
    for(int i = 1; i <= n; i++) scanf("%lld", pref+i);
    for(int i = 1; i <= n; i++) pref[i] += pref[i-1];
    hull[0].add(0, 0, 0);
    for(int j = 1; j <= k; j++) {
        int now = j & 1, pre = now ^ 1;
        hull[now].clear();
        for(int i = j; i <= n; i++) {
            line ret = hull[pre].query(pref[i]);
            dp[i] = ret.f(pref[i]);
            pv[i][j] = ret.idx;
            hull[now].add(pref[i], dp[i] - pref[i] * pref[i], i);
        }
    }
    vector<int> ans;
    for(int j = k, i = n; j > 1; j--) ans.emplace_back(i = pv[i][j]);
    reverse(ans.begin(), ans.end());
    printf("%lld\n", dp[n]);
    for(int i : ans) printf("%d ", i);
    printf("\n");
 
    return 0;
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:38:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k), ++k;
     ~~~~~~~~~~~~~~~~~~~~~~^~~~~
sequence.cpp:39:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) scanf("%lld", pref+i);
                                 ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29