Submission #1047164

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1047164	2024-08-07 09:41:31	Sharky	Split the sequence (APIO14_sequence)	C++17	0 / 100	15 ms	4188 KiB

sequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
using db = long double;
const int maxn = 1E5+5;
int n, K, l = 1, r = 1, a[maxn], p[maxn], Q[maxn];
vector<int> dp, new_dp;
bool m(int j, int k, int i) {
    return ((dp[k] - dp[j]) * (p[i] - p[k])) <= ((dp[i] - dp[k]) * (p[k] - p[j]));
}
bool idk(int j, int k, int i) {
    return (p[n] - p[i]) * (p[k] - p[j]) <= (dp[k] - dp[j]);
}
int32_t main() {
    cin >> n >> K;
    new_dp.assign(n+1, 0);
    dp.assign(n+1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        p[i] = p[i-1] + a[i];
    }
    for (int i = 1; i <= n; i++) {
        dp[i] = p[i] * (p[n] - p[i]);
    }
    for (int kk = 2; kk <= K; kk++) {
        for (int i = 1; i <= n; i++) Q[i] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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