# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127362 | julia_08 | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 328 KiB |
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 5e3 + 10;
ll s[MAXN];
int besthub(int r, int l, int x[], ll b){
vector<ll> val(r + 1), d(r + 1);
for(int i=1; i<=r; i++){
d[i] = (ll) x[i - 1];
}
for(int i=1; i<=r; i++){
s[i] = s[i - 1] + d[i];
// cout << i << " " << s[i] << "\n";
}
ll ans = 0;
for(ll i=1; i<=r; i++){
val[0] = -1e18;
# | 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... |