백준 21735번 눈덩이 굴리기 C++

https://www.acmicpc.net/problem/21735

21735번: 눈덩이 굴리기

 

백트래킹

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int n, m;
vector<int> v(101, 0);

int ans = 0;

void BT(int idx, int cnt, int _size) {
    if (idx >= n || cnt == m) {
        ans = max(ans, _size);
        return;
    }
    BT(idx + 1, cnt + 1, _size + v[idx + 1]);
    BT(idx + 2, cnt + 1, _size / 2 + v[idx + 2]);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> v[i];
    BT(0, 0, 1);
    cout << ans;
}