随笔分类 - 长乐集训
摘要：Triangle Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 9992 Accepted: 3001 Description Given n distinct points on a plane, your task is t
阅读全文
摘要：1185: [HNOI2007]最小矩形覆盖 Description 分析：有一个比较显然的结论：最小的矩形一定有一条边在凸包上.利用旋转卡壳求出对应边的最远点.这两个是比较容易做到的，有点难的是如何求另外两边的最远点. 另外两个点的位置显然是单峰函数，可以利用旋转卡壳的思想.关键就是如何以当前凸包
阅读全文
摘要：1043: [HAOI2008]下落的圆盘 Description 有n个圆盘从天而降，后面落下的可以盖住前面的。求最后形成的封闭区域的周长。看下面这副图, 所有的红色线条的总长度即为所求. 有n个圆盘从天而降，后面落下的可以盖住前面的。求最后形成的封闭区域的周长。看下面这副图, 所有的红色线条的总
阅读全文
摘要：Grandpa's Estate Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14553 Accepted: 4070 Description Being the only living descendant of his g
阅读全文
摘要：Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 39574 Accepted: 12275 Description Bessie, Farmer John's prize cow, has just
阅读全文
摘要：Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10039 Accepted: 4408 Description Your friend to the south is interested in building fe
阅读全文
摘要：Pipe Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11421 Accepted: 3567 Description The GX Light Pipeline Company started to prepare bent
阅读全文
摘要：Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15967 Accepted: 5063 Description Given n segments in the two dimensional space, wr
阅读全文
摘要：TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16851 Accepted: 8069 Description Calculate the number of toys that land in each bin of
阅读全文
摘要：Build Your Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1121 Accepted: 621 Description Mr. Tenant is going to buy a new house. In f
阅读全文
摘要：Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17149 Accepted: 7373 Description We all know that a pair of distinct poi
阅读全文
摘要：Statement of the Problem Several drawing applications allow us to draw polygons and almost all of them allow us to fill them with some color. The task
阅读全文
摘要：You're given a tree on N vertices. Each vertex has a positive integer written on it, number on the ith vertex being vi. Your program must process two
阅读全文
摘要：F. Heroes of Making Magic III time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output F. Heroes
阅读全文
摘要：2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作，操作有2类： 1、将节点a到节点b路径上所有点都染成颜色c； 2、询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段）， 如“112221”由3段组成：“11”、“222”和“1”。 请
阅读全文
摘要：Decrypt Messages Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 657 Accepted Submission(s): 158
阅读全文
摘要：1036: [ZJOI2008]树的统计Count Description 一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节
阅读全文
摘要：1367: [Baltic2004]sequence Description Input Output 一个整数R Sample Input 7 9 4 8 20 14 15 18 Sample Output 13 HINT 所求的Z序列为6,7,8,13,14,15,18. R=13 分析：左偏树
阅读全文
摘要：2809: [Apio2012]dispatching Description 在一个忍者的帮派里，一些忍者们被选中派遣给顾客，然后依据自己的工作获取报偿。在这个帮派里，有一名忍者被称之为 Master。除了 Master以外，每名忍者都有且仅有一个上级。为保密，同时增强忍者们的领导力，所有与他们工
阅读全文
摘要：Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4775 Accepted: 2827 Description We say that integer x, 0 < x < p, is a prim
阅读全文
浙公网安备 33010602011771号