알고스팟_울타리 자르기(FENCE)

#include<iostream>
#include<vector>
#include <algorithm>
#include <utility>
using namespace std;
 
 
int solve(vector<int>& nums, int start, int end) {
    if (start == end) return nums[start];
    if (end - 1 == start) return min(nums[start], nums[end]) * 2;
    cout << start << " " << end << endl;
    int mid = (start + end) / 2;
    int left = solve(nums,  start, mid);
    int right = solve(nums,  mid + 1, end);
 
    cout << "left :" << left << endl;
    cout << "right :" << right << endl;
 
    int count_left = 1;
    int count_right = 1;
 
    int minsum = 0;
    int length = 0;
    int tmp = nums[mid];
    for (int i = mid; i >= start; i--,count_left++) {
        if (tmp < nums[i])break;
        tmp = nums[i];
 
        for (int j = mid + 1; j <=end; j++,count_right++) {
            if (minsum < min(tmp, nums[j])*(count_left + count_right )) {
                tmp = min(tmp, nums[j]);
                minsum = tmp * (count_left + count_right);
                cout << tmp << " " << count_left << " " << count_right <<" "<< minsum << endl;
            }
        }
        count_right = 1;
    }
    cout << "minsume : " << minsum << endl;
    cout << endl;
 
    return max(max(left, right), minsum);
}
 
 
void main() {
    vector<int> p = { 1, 4, 4, 4, 4, 1, 1 };
 
    cout << solve(p, 0, p.size() - 1);;
}