https://blog.youkuaiyun.com/Loi_LXTTzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Loi_LXTT/article/details/78461522https://blog.youkuaiyun.com/Loi_LXTT/article/details/78461522Loi_LXTTMon, 06 Nov 2017 20:29:47 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78439912https://blog.youkuaiyun.com/Loi_LXTT/article/details/78439912Loi_LXTTFri, 03 Nov 2017 21:35:04 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78437493https://blog.youkuaiyun.com/Loi_LXTT/article/details/78437493Loi_LXTTFri, 03 Nov 2017 17:09:49 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78437276https://blog.youkuaiyun.com/Loi_LXTT/article/details/78437276Loi_LXTTFri, 03 Nov 2017 16:54:19 +0800 #include #include #]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78421760https://blog.youkuaiyun.com/Loi_LXTT/article/details/78421760Loi_LXTTThu, 02 Nov 2017 10:11:09 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78417939https://blog.youkuaiyun.com/Loi_LXTT/article/details/78417939Loi_LXTTWed, 01 Nov 2017 20:01:55 +0800 x2且区间[c,d] 包含在[a,b]里，则自相矛盾。]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78417612https://blog.youkuaiyun.com/Loi_LXTT/article/details/78417612Loi_LXTTWed, 01 Nov 2017 19:35:14 +0800 #include #include #include using namespace std;long long t,p;int main() { scanf("%lld",&t);]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78399793https://blog.youkuaiyun.com/Loi_LXTT/article/details/78399793Loi_LXTTTue, 31 Oct 2017 09:38:24 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78395034https://blog.youkuaiyun.com/Loi_LXTT/article/details/78395034Loi_LXTTMon, 30 Oct 2017 17:14:02 +0800=a*b*c的（a,b）的个数，即所有满足条件的a,b,c的个数。 问题转化为，求满足条件的组合（a,b,c）的排列数之和。 先求]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78389550https://blog.youkuaiyun.com/Loi_LXTT/article/details/78389550Loi_LXTTMon, 30 Oct 2017 07:04:00 +0800b=0,b–>a=0 ②a>=b 建边 b–>a=0 ③a>b 建边b–>a=1 为什么呢？ 因为要求最少糖果数，那么对于a=b和a>=b的情况，就都让它们相差的最少，就是0，对于a>b，差的最少就是1，所以建边为1. 然后跑最长路。因为对于一个学生的糖果数量，要尽可能满足所有人的要求。如果存在最长路，那么该同学的糖果数就]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78387308https://blog.youkuaiyun.com/Loi_LXTT/article/details/78387308Loi_LXTTSun, 29 Oct 2017 19:42:35 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78386894https://blog.youkuaiyun.com/Loi_LXTT/article/details/78386894Loi_LXTTSun, 29 Oct 2017 18:25:20 +0800 #include #]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78379117https://blog.youkuaiyun.com/Loi_LXTT/article/details/78379117Loi_LXTTSat, 28 Oct 2017 20:45:36 +0800 #include #include #include #include using namespace std;const int mo=2333,e=301; int]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78376791https://blog.youkuaiyun.com/Loi_LXTT/article/details/78376791Loi_LXTTSat, 28 Oct 2017 16:14:34 +0800 #include #include #include using namespace std;const int maxn=2000+10; int cnt,t,n; int]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78366825https://blog.youkuaiyun.com/Loi_LXTT/article/details/78366825Loi_LXTTFri, 27 Oct 2017 16:58:59 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78360982https://blog.youkuaiyun.com/Loi_LXTT/article/details/78360982Loi_LXTTFri, 27 Oct 2017 09:21:43 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78356072https://blog.youkuaiyun.com/Loi_LXTT/article/details/78356072Loi_LXTTThu, 26 Oct 2017 17:04:46 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78343060https://blog.youkuaiyun.com/Loi_LXTT/article/details/78343060Loi_LXTTWed, 25 Oct 2017 16:31:06 +0800https://blog.youkuaiyun.com/Loi_LXTT/article/details/78341377https://blog.youkuaiyun.com/Loi_LXTT/article/details/78341377Loi_LXTTWed, 25 Oct 2017 14:45:00 +0800 #in]]>https://blog.youkuaiyun.com/Loi_LXTT/article/details/78341015https://blog.youkuaiyun.com/Loi_LXTT/article/details/78341015Loi_LXTTWed, 25 Oct 2017 14:21:29 +0800 #include #include #include #include using namespace std;const int maxn=1000+10; int N,R,C,dx,dy; int e[maxn]; cha]]>