摘要: 二分答案 + 2-SAT验证,判断正方形是否相交写起来有点烦,思路还是挺简单的。#include#include#include#include#include#includeusing namespace std;const int maxn=1005;struct Point{ doubl... 阅读全文
posted @ 2015-10-28 20:44 Fighting_Heart 阅读(145) 评论(0) 推荐(0) 编辑
摘要: 2-SAT 裸题,搞之#include#include#include#include#include#includeusing namespace std;const int maxn=2000+10;int N,M;char s1[100],s2[100];stackS;vectorG[maxn... 阅读全文
posted @ 2015-10-28 14:45 Fighting_Heart 阅读(150) 评论(0) 推荐(0) 编辑
摘要: 2-SAT简单题,判断一下两个开区间是否相交#include#include#include#include#include#include#includeusing namespace std;const int maxn=2000+10;int N,M;struct Time{ int S... 阅读全文
posted @ 2015-10-28 11:20 Fighting_Heart 阅读(125) 评论(0) 推荐(0) 编辑