Div3 595 E

Posted 2021-03-24

鏍囩锛?a href='http://www.mamicode.com/so/1/elevator' title='elevator'>elevator   span   cin   mem   浜岀淮   ems   ble   tor   return   

By Elevator or Stairs?

绠€鍗曠殑浜岀淮DP

$f[i][j] $ 琛ㄧず绗?(i-1) 灞備娇鐢?绗?span class="math inline">(j) 绉嶆柟娉曡揪鍒?绗?(i) 鎵€闇€瑕佺殑鏈€鐭椂闂达紝(j = 0) 浠ｈ〃 璧版ゼ姊紝(j = 1) 鐢垫銆?/p>

(f[i+1][0]) 琛ㄧず绗?(i) 灞備娇鐢?妤兼 鍒拌揪 绗?span class="math inline">(i+1) 灞傜殑鏈€鐭椂闂?/p>

鍙湁褰撶(i) 灞傝蛋妤兼锛岀 (i+1) 灞傝蛋鐢垫鐨勬椂鍊欙紝鎵嶇敤鍔犱笂 (c) 瀹冩槸绛夊緟鐢垫鐨勬椂鍊欙紝

濡傛灉 绗?(i) 灞傚凡缁忓湪鐢垫閲岄潰锛岀(i+1) 涓嶇敤绛夌數姊氨鍙互涓婂幓浜嗭紝鎵€浠ヤ笉鐢ㄥ姞 (c)

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n,c;
int a[N],b[N],f[N][2]; // f1,0 涓嶅湪鐢垫锛宖1,1 鍦ㄧ數姊唴
int main(){
    bool ok = 1;
    cin >> n >> c;
    for(int i = 1;i < n; ++i) cin >> a[i];
    for(int i = 1;i < n; ++i) cin >> b[i];
    memset(f,0x3f,sizeof f);
    f[1][0] = 0,f[1][1] = c;
    for(int i = 1;i < n; ++i){
        f[i+1][0] = min(f[i+1][0],f[i][1] + a[i]);
        f[i+1][0] = min(f[i+1][0],f[i][0] + a[i]);
        f[i+1][1] = min(f[i+1][1],f[i][1] + b[i]);
        f[i+1][1] = min(f[i+1][1],f[i][0] + b[i] + c);
    }
    for(int i = 1;i <= n; ++i) cout << min(f[i][0],f[i][1]) <<" ";
    return 0;
}