Linfanty的博客

https://vjudge.net/contest/149236#problem/G http://blog.youkuaiyun.com/lawrencesgj/article/details/8001638 dovebs：动态规划 http://blog.youkuaiyun.com/u012773338/article/details/29352841 NowAndForever： sort(t

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called

题目 https://vjudge.net/contest/149236#problem/D 首先 scanf时就swap 排序 很方便 for(int j=0; j<N; j++) { scanf("%d %d",&begin,&end); if(begin>end) swap(begin,end); for(int k=(begin+1)/2; k<=(end+1)/2;