oj.uz

답안 #95808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
95808 2019-02-02T17:38:30 Z fedoseevtimofey 수열 (APIO14_sequence) C++14
100 / 100
 644 ms 84148 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
struct line {
    ll k, b;
    line (ll k, ll b) : k(k), b(b) {}
};
 
ll f(const line &l, ll x) {
    return l.k * x + l.b;
}
 
ld inter(const line &a, const line &b) {
    return (ld)(a.b - b.b) / (b.k - a.k);
}
 
vector <line> s;
vector <int> idx;

int ptr = 0;
 
void push(const line &l, int id) {
    while ((int)s.size() && s[(int)s.size() - 1].k == l.k && s[(int)s.size() - 1].b <= l.b) {
        s.pop_back();
        idx.pop_back();
    }
    if (!s.empty() && s.back().k == l.k && s.back().b > l.b) return;
    while ((int)s.size() >= 2) {
        line a = s[(int)s.size() - 1];
        line b = s[(int)s.size() - 2];
        if (inter(l, a) <= inter(l, b)) {
            s.pop_back();
            idx.pop_back();
        }
        else {
            break;
        }
    }
    s.push_back(l);
    idx.push_back(id);
}
 
pair <ll, int> get(ll x) {
    ptr = min(ptr, (int)s.size() - 1);
    while (ptr + 1 < (int)s.size() && f(s[ptr], x) <= f(s[ptr + 1], x)) ++ptr;
    return {f(s[ptr], x), idx[ptr]};
}
 
 
const ll Inf = 2e18;
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    int n, k;
    cin >> n >> k;
    vector <int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector <ll> dp(n + 1, -Inf);
    dp[0] = 0;
    vector <ll> pref(n + 1);
    for (int i = 0; i < n; ++i) {
        pref[i + 1] = pref[i] + a[i];
    }
    vector <vector <int>> who(k + 1, vector <int> (n + 1, -1));
    for (int j = 1; j <= k; ++j) {
        ptr = 0;
        s.clear();
        idx.clear();
        push(line(pref[0], -pref[0] * pref[n] + dp[0]), 0);
        dp[0] = -Inf;
        for (int i = 1; i <= n; ++i) {
            auto p = get(pref[i]);
            push(line(pref[i], -pref[i] * pref[n] + dp[i]), i);
            dp[i] = p.first + pref[i] * (pref[n] - pref[i]);
            who[j][i] = p.second;
        }
    }
    ll ans = -1;
    int id = -1;
    for (int i = 1; i < n; ++i) {
        if (dp[i] > ans) {
            ans = dp[i];
            id = i;
        }
    }

    vector <int> where;
    for (int cr = k; cr >= 1; --cr) {
        where.push_back(id);
        id = who[cr][id];
    }
    reverse(where.begin(), where.end());
    cout << ans << '\n';
    for (auto x : where) {
        cout << x << ' ';
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 252 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 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 380 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 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 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 380 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 256 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 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
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 376 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 380 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 376 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 504 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 504 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 504 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 504 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 376 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 376 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 376 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 1144 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 1144 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 7 ms 1016 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 1144 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 1144 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 504 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 760 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 888 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 1016 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 50 ms 8824 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 1144 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 42 ms 5584 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 46 ms 6264 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 48 ms 6840 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 35 ms 5752 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 40 ms 6520 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 51 ms 8056 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 6508 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 19 ms 6380 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 446 ms 83860 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 6892 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 644 ms 84148 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 550 ms 60396 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 477 ms 64620 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 351 ms 53612 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 367 ms 60524 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 494 ms 76396 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845