# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466938 | AMO5 | Discharging (NOI20_discharging) | C++17 | 1087 ms | 33472 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 fi first
#define se second
#define ld long double
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define dbg if(0)
#define BUG(x) dbg cerr << (#x) << " is " << (x) << endl
const int mxn = (int)1e6+5;
const int64_t inf = 5e18;
void solve(){
int n; cin>>n;
vector<int64_t>a(n);
for(auto &x:a)
{
cin>>x;
}
//dp
//when n is small
vector<array<int64_t,2>>dp(n);
for(int i=0; i<n; i++){
int64_t now = a[i], res = 0, tmp = 0;
for(int len=1,j=i; j>=0; j--,len++){
now = max(now,a[j]);
int64_t prev_sum = (j>0?dp[j-1][1]:(int64_t)0);
# | 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... |