辣鸡elijahqi

细节决定成败 心态决定一切

codeforces 986B Petr and Permutations

http://www.elijahqi.win/archives/3560 Petr likes to come up with problems about randomly generated data. This time problem is about random permutati...

2018-05-31 18:39:25

阅读数:59

评论数:0

codeforces 987 C Three displays

http://www.elijahqi.win/archives/3558 问连续的下标连续的最大i最后连续值是多少 i直接dp即可 设dp[i][j][k]表示前i个选了j个的最优值 #include<cstdio> #include&a...

2018-05-31 18:33:44

阅读数:37

评论数:0

codeforces 987A Infinity Gauntlet

http://www.elijahqi.win/archives/3555 #include<cstdio> int n;char s[100];bool mark[100]; int main(){ // freopen("a...

2018-05-31 18:25:13

阅读数:33

评论数:0

codeforces 987B High School: Become Human

http://www.elijahqi.win/archives/3553 Year 2118. Androids are in mass production for decades now, and they do all the work for humans. But androids ...

2018-05-31 18:22:07

阅读数:28

评论数:0

codeforces 981F Round Marriage

http://www.elijahqi.win/archives/3549 题目描述 It’s marriage season in Ringland! Ringland has a form of a circle’s boundary of length L L . There ar...

2018-05-31 16:43:05

阅读数:158

评论数:0

codeforces 986A Fair

http://www.elijahqi.win/archives/3546 Some company is going to hold a fair in Byteland. There are n n towns in Byteland and m m two-way roads ...

2018-05-30 21:37:43

阅读数:77

评论数:0

bzoj 4589 Hard Nim

http://www.elijahqi.win/archives/3544 Description Claris和NanoApe在玩石子游戏,他们有n堆石子,规则如下: 1. Claris和NanoApe两个人轮流拿石子,Claris先拿。 2. 每次只能从一堆中取若干个,可将一堆全取走,...

2018-05-30 20:36:52

阅读数:23

评论数:0

hdu5909 Tree Cutting

http://www.elijahqi.win/archives/3542 Problem Description Byteasar has a tree T with n vertices conveniently labeled with 1,2,…,n. Each vertex of t...

2018-05-29 12:13:56

阅读数:23

评论数:0

bzoj 2734 [HNOI2012]集合选数

http://www.elijahqi.win/archives/3540 Description 《集合论与图论》这门课程有一道作业题,要求同学们求出{1, 2, 3, 4, 5}的所有满足以 下条件的子集:若 x 在该子集中,则 2x 和 3x 不能在该子集中。同学们不喜欢这种具有枚举性 ...

2018-05-29 10:44:39

阅读数:21

评论数:0

codeforces 981 A Antipalindrome

http://www.elijahqi.win/archives/3538 A string is a palindrome if it reads the same from the left to the right and from the right to the left. For ...

2018-05-28 23:46:36

阅读数:30

评论数:0

codeforces 981 B Businessmen Problems

http://www.elijahqi.win/archives/3535 Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered che...

2018-05-28 23:42:03

阅读数:61

评论数:0

codeforces 981D Bookshelves

http://www.elijahqi.win/archives/3533 D. Bookshelves time limit per test 1 second memory limit per test 256 megabytes input standard input ou...

2018-05-28 23:36:51

阅读数:69

评论数:0

bzoj 5359 [Lydsy1805月赛]寻宝游戏

http://www.elijahqi.win/archives/3529 有k次交换数字的机会 求从1,1->n,m能够获得的最大代价是多少 因为有很多路径代价是相同的但是选择的效果却不同 在月赛的时候我直接朴素dp+贪心 秒wa 思路非常巧妙 想hack icefo...

2018-05-28 21:52:24

阅读数:134

评论数:0

codeforces 981 C Useful Decomposition

http://www.elijahqi.win/archives/3527 Ramesses knows a lot about problems involving trees (undirected connected graphs without cycles)! He created ...

2018-05-28 17:13:52

阅读数:47

评论数:0

codeforces 981E Addition on Segments

http://www.elijahqi.win/archives/3523 题目描述 Grisha come to a contest and faced the following problem. You are given an array of size n n , init...

2018-05-28 13:48:36

阅读数:173

评论数:0

bzoj 5365 [Lydsy1805月赛]回文树

http://www.elijahqi.win/archives/3521 虽然lct不能维护hash是错的 但是我们的AK王icefox巨佬依然可以AK 这就是具有神犇体质的人 因为自己没写过直接贴大爷的代码了 get一个技能判断回文可以用正向hash和逆向hash判断 是否相同即可确定...

2018-05-28 13:36:20

阅读数:125

评论数:0

bzoj 5358[Lydsy1805月赛]口算训练

http://www.elijahqi.win/archives/3516 begin.lydsy.com/JudgeOnline/upload/201805.pdf 维护主席树 主席树上维护 每种质因数分别出现了多少次 判断是否可行 直接暴力枚举这个数的质因数即可 最多6种情况判断我区间...

2018-05-28 13:21:30

阅读数:108

评论数:0

bzoj 5361 [Lydsy1805月赛]对称数

http://www.elijahqi.win/archives/3514 begin.lydsy.com/JudgeOnline/upload/201805.pdf mdzz真是气疯了 一开写的时候还想 有没有可能全部数字都是出现奇数次啊 那怎么没让我输出-1啊 claris 一定是非常好...

2018-05-28 13:13:01

阅读数:150

评论数:2

bzoj1195 [HNOI2006]最短母串

http://www.elijahqi.win/archives/3512 Description 给定n个字符串(S1,S2,„,Sn),要求找到一个最短的字符串T,使得这n个字符串(S1,S2,„,Sn)都是T的子串。 Input 第一行是一个正整数n(n<=12...

2018-05-28 08:11:34

阅读数:30

评论数:0

bzoj 2844 albus就是要第一个出场

http://www.elijahqi.win/archives/3501 Description 已知一个长度为n的正整数序列A(下标从1开始), 令 S = { x | 1 <= x <= n }, S 的幂集2^S定义为S 所有子 集构成的集...

2018-05-27 18:46:13

阅读数:27

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭