oj.uz

답안 #154859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154859 2019-09-25T11:43:15 Z srvlt 수열 (APIO14_sequence) C++14
11 / 100
 50 ms 9984 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse2,avx")
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define int long long
using namespace std;

void dout() {
    cerr << endl;
}

template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
const int N = 1e5 + 3, K = 203;
int n, k, a[N], dp[K][N], p[N], last[K][N];

struct line {
    int k = 0, b = 0;
    int val(int x) {
        return k * x + b;
    }
    db intrsc(const line & l) {
        return (db)(l.b - b) / (k - l.k);
    }
    bool del(line & l1, line & l2) {
        if (k == l1.k) {
            return b > l1.b;
        }
        return intrsc(l2) > l1.intrsc(l2);
    }
};

vector <line> h;
vector <int> ind, ans;

void upd(int x, int y, int pos) {
    line tmp;
    tmp.k = x, tmp.b = y;
    while (h.size() > 1 && tmp.del(h[h.size() - 1], h[h.size() - 2])) {
        h.ppb();
        ind.ppb();
    }
    h.pb(tmp);
    ind.pb(pos);
}

pii getmax(int x) {
    if (h.empty()) {
        return {0, 0};
    }
    int l = 0, r = h.size() - 1;
    while (l < r) {
        int mid = (l + r) / 2;
        if (h[mid].val(x) < h[mid + 1].val(x)) {
            l = mid + 1;
        }   else {
            r = mid;
        }
    }
    return {h[l].val(x), ind[l]};
}

void getans(int x, int y) {
    if (!y) {
        return;
    }
    ans.pb(y);
    getans(x - 1, last[x][y]);
}

void solve(int tc) {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        p[i] = p[i - 1] + a[i];
    }
    for (int i = 1; i <= k; i++) {
        h = {};
        ind = {};
        for (int j = 1; j < i; j++) {
            if (i > 1) {
                upd(-p[j], dp[i - 1][j], j);
            }
        }
        for (int j = i; j < n; j++) {
            int x = p[n] - p[j];
            pii z = getmax(x);
            dp[i][j] = p[j] * x + z.fi;
            last[i][j] = z.se;
            if (i > 1) {
                upd(-p[j], dp[i - 1][j], j);
            }
        }
    }
    int res = -1;
    for (int i = 1; i < n; i++) {
        if (res == -1 || dp[k][res] < dp[k][i]) {
            res = i;
        }
    }
    getans(k, res);
    cout << dp[k][res] << endl;
    reverse(ans.begin(), ans.end());
    for (auto i : ans) {
        cout << i << " ";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 504 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 3 ms 504 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 380 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 3 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 3 ms 428 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 3 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 3 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 3 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 404 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 3 ms 860 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 2 ms 504 KB contestant didn't find the optimal answer: 1005044744 < 1005304678
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB contestant didn't find the optimal answer: 409330127 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 508 KB contestant didn't find the optimal answer: 21499262 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1400 KB contestant didn't find the optimal answer: 1665914748 < 1818678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 9984 KB contestant didn't find the optimal answer: 19795716773 < 19795776960
2 Halted 0 ms 0 KB -