摘要： /* 应该算个简单题*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <st 阅读全文

摘要： /*宽度优先搜索啥时候才能杜绝小错误呢，以后ij一定不在搞混了*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bits 阅读全文

摘要： /*动归，自己开始没搞清楚，怎样来表达只有当休息为0的时候才继续跑步或者休息如果休息的话，不参与计算任务。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomani 阅读全文

摘要： /* 构图很关键，由于是开区间，所以可以把顶点之间的边当成是线段之间的点。 每条线段之间的边的容量定义为k,说明这个线段只能交叉k次。,k次之后就不能从这个线段交叉过去了。 好题*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#includ 阅读全文