wuyin_Jane的博客

DescriptionWe were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected subsequence contains a unique element, i.e

https://vjudge.net/problem/HDU-5925/** 题意：一张最大1e9*1e9的图中，最多200个坏点，求连通块个数和大小 思路：二维坐标离散， 将相邻的空行压缩成一行，用数组记录该行表示的大小， 对列也是如此。 离散前需要加上边界，然后分别对横纵坐标离散化 vx[],vy[]分别记录...