알고리즘 문제 풀이/1DP_과제(~180615)
180406_14889_스타트와 링크
//https://www.acmicpc.net/problem/14889 #include #include using namespace std;int abs(int a, int b) { return (a-b)>(b-a)? (a-b):(b-a); } int s[21][21];bool start[20];int ss;//start scoreint ls;//link scoreint n;int mn=1e9; void dfs(int idx, int depth);int main(){ cin >> n; for(int i=0; i s[i][j]; else{ int a; cin >> a; s[j][i]+=a; } } for(int i=0; i
