ZROI #364. [2018普转提day18专题]嘤嘤嘤 直接贴代码 具体见注释 #include<stdio.h> #include<cstring> #include<cstdlib> #include<algorithm> #include<vector> #include<map> #include<set> #include<cmath> #include<iostream> #inc…

ZROI #365. [2018普转提day18专题]嘤嘤嘤嘤 直接放代码 具体做法见注释 #include<stdio.h> #include<cstring> #include<cstdlib> #include<algorithm> #include<vector> #include<map> #include<set> #include<cmath> #include<iostream> #…

01: 02:https://www.cnblogs.com/myx12345/p/9436953.html 03: 04: 05:https://www.cnblogs.com/myx12345/p/9435543.html 06: 07: 08: 09: 10: 11: 12:…

01: 02:https://www.cnblogs.com/myx12345/p/9407551.html 03: 04:https://www.cnblogs.com/myx12345/p/9406565.html 05: 06: 07: 08: 09: 10: 11:https://www.cnblogs.com/myx12345/p/9406539.html 12:https://www.cnblogs.com/myx12345/p/9406511.html…

01:https://www.cnblogs.com/myx12345/p/9420198.html 02: 03: 04:https://www.cnblogs.com/myx12345/p/9405727.html 05: 06:http://www.cnblogs.com/myx12345/p/9405771.html 07: 08: 09: 10: 11: 12:http://www.cnblogs.com/myx12345/p/9405807.html 13:…

01: 02: 03: 04:https://www.cnblogs.com/myx12345/p/9394511.html 05: 06: 07:https://www.cnblogs.com/myx12345/p/9396412.html 08: 09: 10:https://www.cnblogs.com/myx12345/p/9394689.html 队友:Gold_7,lyy,Man_Goph Gold_7出1题,lyy出1题,Man_Goph出1题 继续全程负贡献挂机 再次惨遭现役选…

01:https://www.cnblogs.com/myx12345/p/9362221.html 02:https://www.cnblogs.com/myx12345/p/9382267.html 03:https://www.cnblogs.com/myx12345/p/9378292.html 04:https://www.cnblogs.com/myx12345/p/9389323.html 05: 06: 07:https://www.cnblogs.com/myx12345/p/…

HDU 4678 Mine 对于每个空白区域,求SG值. 最后异或起来等于0,先手必败. #pragma comment(linker,"/STACK:102400000,102400000") #include<cstdio> #include<cstring> #define MAXN 1010 #define oo 1234567890 int arr[MAXN][MAXN]; bool vis[MAXN][MAXN]; int n, m; int dg,…

HDU 4666 Hyperspace 曼哈顿距离:|x1-x2|+|y1-y2|. 最远曼哈顿距离,枚举x1与x2的关系以及y1与y2的关系,取最大值就是答案. #include<cstdio> #include<set> #define oo 0x7FFFFFFF #define MAXM 35 #define MAXN 100010 using namespace std; multiset<int> myset[MAXM]; struct Ask { int c…

HDU 4655 Cut Pieces 假设n个数构成的总数都分成了n段,总数是n*a1*a2*...*an.但是答案显然不会那么多. 对于相邻的两个ai,ai+1,如果选择相同的颜色,那么就减少了a1*a2*...*ai-1*min(ai,ai+1)*ai+2*ai+3*...*an. 不妨假设n=3,三个数分别是a,b,c.且a<b<c. 对于所有的排列,只有a,c,b是最优的,结果是3*a*b*c-a*b-b. 当n>3的时候同样可以得到结论:a1,an,a2,an-1...使得总…