Educational Codeforces Round 106 (Rated for Div. 2) C
还是太菜了,17分钟签完到,就自闭了。C题题目描述你从(0,0)(0,0)(0,0)走到(n,n)(n,n)(n,n),只能up/rightup/rightup/right,每次方向转变,最多只能转变(n−1)(n-1)(n−1)次,所以就有n个segmentsegmentsegment。然后还会给你n~n^~n个cost-CiC_iCi。问你最小花费是多少。思路当时比赛的时候就想到是贪心,就是最