BZOJ 1185. [HNOI2007] Minimum Rectangle Coverage
Original link: https://www.shuizilong.com/house/archives/bzoj-1185-hnoi2007%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E8%A6 %86%E7%9B%96/ Classic question. . test template. . #include <lastweapon/geometry> using namespace lastweapon; using namespace CG; typedef vector<Po> VP; /*#define suc(x) (x+1==n?0:x+1) DB rc(const VP&P){ int n = SZ(P)-1, j = 1; DB d2 = 0; REP(i, n){ while (dett(P[i+1]-P[i], P[j+1]-P[j])>0) j=suc(j); checkMax(d2, max(dist2(P[i], P[j]), dist2(P[i+1], P[j+1]))); } return d2; }*/ #define suc(x) […]
BZOJ 1185. [HNOI2007] Minimum Rectangle Coverage Read More »