wqq的博客

题目链接http://poj.org/problem?id=2991题意简而言之，就是有 nnn 条接在一起的线段，最初是在同一条直线上，然后有 mmm 次操作，每次可以修改某两个相邻线段间的角度，然后问最后一条线段末端的坐标。思路如果把每个线段看成一个向量(x,y)(x,y)(x,y)，然后向量间的加减操作很简单，也即是 x,yx,yx,y 的叠加。所以如果把每条线段看作是一个向量的话...

题目链接：https://cometoj.com/contest/79/problem/B?problem_id=4199

http://poj.org/problem?id=1113Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King’s castle. The King was so greedy, that he would not listen to hi...