poj 2018 (二分判定 最大长度不小于L的子段和
Best Cow Fences#include <cstdio>#include <cstring>#include <string>#include <cmath>#include <iostream>#include <algorithm>#include <vector>#include <stack>#include <queue>#include <stdlib.h
原创
2021-03-30 20:25:21 ·
171 阅读 ·
0 评论