# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546253 | theshadow_04 | Split the sequence (APIO14_sequence) | C++14 | 964 ms | 85256 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.
// annotshy
#include <bits/stdc++.h>
#define Task "CF"
#define F first
#define S second
using namespace std;
const int maxn = 100005;
int n, k;
int a[maxn], s[maxn];
bool maximize(long long &x, long long y) {
if(x < y) {x = y; return 1;}
return 0;
}
//namespace BF {
//
// long long dp[205][205];
// int tr[205][205];
//
// void Solve() {
// memset(dp, -0x3f, sizeof dp);
// dp[0][0] = 0;
// for(int i = 1; i <= n; ++ i) {
// for(int j = 0; j < k; ++ j) if(dp[i - 1][j] >= 0) {
Compilation message (stderr)
# | 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... |