매출 하락 최소화 C++

https://programmers.co.kr/learn/courses/30/lessons/72416

코딩테스트 연습 - 매출 하락 최소화

 

#include <string>
#include <vector>
#include <algorithm>

using namespace std;
const int MAX = 300001;
int sale[MAX];
int v[MAX][2];
vector<int> team[MAX];

void FindMinValue(int turn){
    v[turn][0] = 0;
    v[turn][1] = sale[turn];
    int minvalue = 987654321;
    
    if(team[turn].size() == 0)
        return;
    
    for(int i=0; i<team[turn].size(); i++){
        FindMinValue(team[turn][i]);
        if(v[team[turn][i]][0] < v[team[turn][i]][1] ){
            v[turn][0] += v[team[turn][i]][0];
            v[turn][1] += v[team[turn][i]][0];
            minvalue = min(minvalue,v[team[turn][i]][1]-v[team[turn][i]][0]);
        }
        else{
            v[turn][0] += v[team[turn][i]][1];
            v[turn][1] += v[team[turn][i]][1];
            minvalue = 0;
        }
    }
    v[turn][0] += minvalue;
}

int solution(vector<int> sales, vector<vector<int>> links) {
    for(int i=0; i<sales.size(); i++){
        sale[i] = sales[i];
    }
    
    for(int i=0; i<links.size(); i++){
        team[links[i][0]-1].push_back(links[i][1]-1);
    }
    
    FindMinValue(0);
    return min(v[0][0],v[0][1]);
}