제출 #719744

#제출 시각아이디문제언어결과실행 시간메모리
719744bin9638모임들 (IOI18_meetings)C++17
19 / 100
635 ms234720 KiB
#include <bits/stdc++.h>

#ifndef SKY
#include "meetings.h"
#endif // SKY

using namespace std;

#define N 5010
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

int n,q;
ll a[N],sum_left[N][N],sum_right[N][N];

vector<ll> minimum_costs(vector<int> H, vector<int> L,vector<int> R)
{
    n=H.size();
    for(int i=0;i<n;i++)
        a[i]=H[i];
    q=L.size();
    vector<ll>kq(q);
    for(int i=0;i<n;i++)
    {
        ll sum=0,val=0;
        for(int j=i;j>=0;j--)
        {
            val=max(val,a[j]);
            sum+=val;
            sum_left[i][j]=sum;
        }
        sum=0,val=0;
        for(int j=i;j<n;j++)
        {
            val=max(val,a[j]);
            sum+=val;
            sum_right[i][j]=sum;
        }
    }
    for(int t=0;t<q;t++)
    {
        int l=L[t],r=R[t];
        ll res=1e18;
        for(int i=l;i<=r;i++)
            res=min(res,sum_left[i][l]+sum_right[i][r]-a[i]);
        kq[t]=res;
    }
    return kq;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    return 0;
}
#endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...