# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946240 | KK_1729 | Split the sequence (APIO14_sequence) | C++17 | 2058 ms | 32912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"
void printVector(vector<int> a){
for (auto x: a) cout << x << " ";
cout << endl;
}
int max(int x, int y){
if (x > y) return x;
else return y;
}
void solve(){
int n, k; cin >> n >> k;
vector<int> a(n+1);
FOR(i,0,n) cin >> a[i+1];
vector<int> prefix(n+1);
FOR(i,1,n+1) prefix[i] = prefix[i-1]+a[i];
vector<vector<int>> dp(n+1, vector<int>(k+2));
vector<vector<int>> prev(n+1, vector<int>(k+2));
for (int j = 1; j <= k+1; ++j){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |