随笔分类 -  算法->模拟

【LOJ】#2569. 「APIO2016」最大差分
摘要：题解 第一个子任务直接询问最大最小，每次可以问出来两个，再最大最小 1再问两个，最多问$\frac{N + 1}{2}$次就还原出了序列 第二个子任务由于差分肯定会大于等于$\lceil \frac{mx mn}{N 1} \rceil$ 那么我们直接把序列最大最小按照这个值分块，只用两个块之间的差 阅读全文
posted @ 2018-12-17 11:37 sigongzi 阅读(465) 评论(0) 推荐(0)
【LOJ】#2493. 「BJOI2018」染色
摘要："题面" 题解 推结论大题……然而我推不出什么结论 奇环显然是NO 如果一个联通块里有两个分离的环，也是NO 如果一个联通块里，点数为n，边数为m m = n + 2的时候，肯定是NO m = n + 1的时候 如果只存在一个双联通分量的话，取出这个双联通分量，存在两个点点度为3 他们之间有3条路径 阅读全文
posted @ 2018-11-19 17:05 sigongzi 阅读(1162) 评论(3) 推荐(0)
USACO 6.2 Packing Rectangles
摘要：Four rectangles are given. Find the smallest enclosing (new) rectangle into which these four may be fitted without overlapping. By smallest rectangle, 阅读全文
posted @ 2017-04-03 18:55 sigongzi 阅读(494) 评论(0) 推荐(0)
USACO 6.2 Shaping Regions
摘要：Shaping Regions N opaque rectangles (1 <= N <= 1000) of various colors are placed on a white sheet of paper whose size is A wide by B long. The rectan 阅读全文
posted @ 2017-04-03 17:35 sigongzi 阅读(346) 评论(0) 推荐(0)
USACO 5.3 Window Area
摘要：You've just be assigned the project of implemented a windowing interface. This windowing interface is fairly simple, and fortunately, you don't have t 阅读全文
posted @ 2017-02-14 16:55 sigongzi 阅读(293) 评论(0) 推荐(0)
USACO 5.1 Starry Night
摘要：High up in the night sky, the shining stars appear in clusters of various shapes. A cluster is a non-empty group of neighbouring stars, adjacent in ho 阅读全文
posted @ 2017-02-05 21:29 sigongzi 阅读(623) 评论(0) 推荐(0)
noip2016模拟赛Day1T3-跳跃切除子序列
该文被密码保护。
posted @ 2016-10-23 19:38 sigongzi 阅读(6) 评论(0) 推荐(0)
USACO 1.3 Wormholes
摘要：Farmer John's hobby of conducting high-energy physics experiments on weekends has backfired, causing N wormholes (2 <= N <= 12, N even) to materialize 阅读全文
posted @ 2016-08-28 17:23 sigongzi 阅读(2208) 评论(0) 推荐(0)
暑假集训2016noip模拟Day2T3-transport
该文被密码保护。
posted @ 2016-08-18 20:40 sigongzi 阅读(4) 评论(0) 推荐(0)