Submission #58753

#	Time	Username	Problem	Language	Result	Execution time	Memory
58753		TAMREF	오렌지 출하 (JOI16_ho_t1)	C++11	100 / 100	150 ms	5796 KiB

2016_ho_t1

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int mx = 2e5, mlgx = log2(mx)+1;
const ll inf = 1e16;

ll D[mx];
ll A[mx];
int n, m;
ll k;

ll tmax[mlgx][mx];
ll tmin[mlgx][mx];
int tlg[mx];

inline ll rMq_rmq(int s, int e){
    int lev = tlg[e-s+1];
    ll RMQ = max(tmax[lev][s], tmax[lev][e-(1<<lev)+1]);
    ll rmq = min(tmin[lev][s], tmin[lev][e-(1<<lev)+1]);
    return RMQ-rmq;
}

void input(){
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        cin >> A[i];
    }
    for(int i = 1; i <= n; i++){
        int j = 0;
        while((1<<j+1) <= i) ++j;
        tlg[i] = j;
    }
    copy(A+1,A+n+1,tmax[0]+1);
    copy(A+1,A+n+1,tmin[0]+1);

    for(int l = 1, b = 1; (1<<l) <= n; l++, b <<= 1){
        for(int i = 0; i + b <= n; i++){
            tmax[l][i] = max(tmax[l-1][i], tmax[l-1][i+b]);
            tmin[l][i] = min(tmin[l-1][i], tmin[l-1][i+b]);
        }
    }
}

void dp(){
    for(int i = 1; i <= n; i++){
        D[i] = inf;
        ll tmp;
        for(int j = max(0,i-m); j < i; j++){
            tmp = k + rMq_rmq(j+1,i) * (i - j);
            D[i] = min(D[i], D[j] + tmp);
        }
    }
    cout << D[n] << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    input();
    dp();
}

Compilation message (stderr)

2016_ho_t1.cpp: In function 'void input()':
2016_ho_t1.cpp:31:20: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
         while((1<<j+1) <= i) ++j;
                   ~^~

• Subtask 1: 20 / 20
• Subtask 2: 50 / 50
• Subtask 3: 30 / 30