nimphy - 博客园

2019年1月19日

ZOJ - 4086: Little Sub and a Game (线性基贪心) （占位）

该文被密码保护。阅读全文

posted @ 2019-01-19 21:58 nimphy 阅读(18) 评论(2) 推荐(0) 编辑

ZOJ - 4089 :Little Sub and Isomorphism Sequences (同构 set)

摘要： Little Sub has a sequence . Now he has a problem for you. Two sequences of length and of length are considered isomorphic when they meet all the follo 阅读全文

posted @ 2019-01-19 21:51 nimphy 阅读(426) 评论(0) 推荐(1) 编辑

ZOJ - 4082:Little Sub and his Geometry Problem （双指针）

摘要： Little Sub loves math very much, and has just come up with an interesting problem when he is working on his geometry homework. It is very kind of him 阅读全文

posted @ 2019-01-19 21:46 nimphy 阅读(519) 评论(0) 推荐(0) 编辑

ZOJ - 4081:Little Sub and Pascal's Triangle (结论)

摘要： Little Sub is about to take a math exam at school. As he is very confident, he believes there is no need for a review. Little Sub's father, Mr.Potato, 阅读全文

posted @ 2019-01-19 21:37 nimphy 阅读(202) 评论(0) 推荐(0) 编辑

2019年1月14日

CodeForces - 1100F：Ivan and Burgers （线性基&贪心）(离线在线)

摘要：题意：给定N个数，Q次询问，求区间最大异或和。思路：一开始想的线性基+线段树。单次线性基合并的复杂度为20*20，结合线段树，复杂度为O(NlogN*20*20)；显然，超时。超时代码： #include<bits/stdc++.h> #define pb push_back #define r 阅读全文

posted @ 2019-01-14 12:57 nimphy 阅读(1512) 评论(0) 推荐(3) 编辑

2019年1月12日

CodeForces - 1101D：GCD Counting （树分治）

摘要： You are given a tree consisting of n vertices. A number is written on each vertex; the number on vertex i is equal to ai . Let's denote the function g 阅读全文

posted @ 2019-01-12 10:01 nimphy 阅读(852) 评论(0) 推荐(0) 编辑

CodeForces - 1101G :(Zero XOR Subset)-less(线性基)

摘要： You are given an array a1,a2,…,an of integer numbers. Your task is to divide the array into the maximum number of segments in such a way that: each el 阅读全文

posted @ 2019-01-12 09:56 nimphy 阅读(537) 评论(0) 推荐(0) 编辑

2019年1月7日

HihoCoder - 1807:好的数字串 (KMP DP)

摘要： Sample Input Sample Output 给定一个数字字符串S，如果一个数字字符串（只包含0-9，可以有前导0）中出现且只出现1次S，我们就称这个字符串是好的。例如假设S=666，则1666、03660666是好的，6666、66、123不是好的；假设S=1212，则01212、121 阅读全文

posted @ 2019-01-07 18:09 nimphy 阅读(362) 评论(0) 推荐(0) 编辑

HihoCoder - 1801 :剪切字符串 (置换与逆序对)

摘要： Sample Input Sample Output 小Hi有一个长度为N的字符串，这个字符串每个位置上的字符两两不同。现在小Hi可以进行一种剪切操作：选择任意一段连续的K个字符，把这段子串剪下来，粘在串首或者串尾。例如ABCDE -> ADEBC、ABCDE -> BCADE或者ABCDE -> 阅读全文

posted @ 2019-01-07 17:08 nimphy 阅读(262) 评论(0) 推荐(0) 编辑

CodeForces - 1097F：Alex and a TV Show （bitset & 莫比乌斯容斥）

摘要： Alex decided to try his luck in TV shows. He once went to the quiz named "What's That Word?!". After perfectly answering the questions "How is a pseud 阅读全文

posted @ 2019-01-07 13:05 nimphy 阅读(261) 评论(0) 推荐(0) 编辑

---学习ing---

学习ing、创业ing