02 2020 档案

C - 4 Values whose Sum is 0（二分）
摘要：题目链接：https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3593 题意：输入n*4的矩阵，从4列中每个选一个数求有多少个和为0； 1 6 -45 22 42 -1 阅读全文
posted @ 2020-02-29 00:12 liyexin 阅读(172) 评论(0) 推荐(0)
B - Stacks of Flapjacks UVA - 120
摘要：BackgroundStacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and 阅读全文
posted @ 2020-02-27 23:23 liyexin 阅读(180) 评论(0) 推荐(0)
Marvolo Gaunt's Ring（巧妙利用前后缀进行模拟）
摘要：Description Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw 阅读全文
posted @ 2020-02-20 23:25 liyexin 阅读(287) 评论(0) 推荐(0)
Codeforces Round #619 (Div. 2)
摘要：http://codeforces.com/contest/1301 Dark is going to attend Motarack’s birthday. Dark decided that the gift he is going to give to Motarack is an array 阅读全文
posted @ 2020-02-17 18:08 liyexin 阅读(248) 评论(0) 推荐(0)
51node 4个数和0
摘要：https://www.51nod.com/Challenge/Problem.html#problemId=1267 第一种方法：两个for+二分：很好理解，不用考虑重复的问题。但是这个还不够快 #include<iostream> #include<cstdio> #include<cstrin 阅读全文
posted @ 2020-02-16 23:47 liyexin 阅读(224) 评论(0) 推荐(0)
Educational Codeforces Round 82 (Rated for Div. 2)
摘要：http://codeforces.com/contest/1303 A: 第一题给一个只有01的字符串，操作是可以删除0，结果要保证1都是挨着的。问最小操作数。 解析：特判，len=1是直接输出0。其他的就是找到第一个为1而且下一位为0的位置，以此往下找，找到第一个为1而且j!=i+1就可以了，减 阅读全文
posted @ 2020-02-14 00:24 liyexin 阅读(236) 评论(0) 推荐(0)
51NOD1050 循环数组最大字段和
摘要：N个整数组成的循环序列a11,a22,a33,…,ann，求该序列如aii+ai+1i+1+…+ajj的连续的子段和的最大值（循环序列是指n个数围成一个圈，因此需要考虑an−1n−1,ann,a11,a22这样的序列）。当所给的整数均为负数时和为0。 例如：-2,11,-4,13,-5,-2，和最大 阅读全文
posted @ 2020-02-11 23:03 liyexin 阅读(156) 评论(0) 推荐(0)
Codeforces Round #617 (Div. 3)
摘要：地址：http://codeforces.com/contest/1296/problem/C C. Yet Another Walking Robot There is a robot on a coordinate plane. Initially, the robot is located a 阅读全文
posted @ 2020-02-09 23:49 liyexin 阅读(206) 评论(0) 推荐(0)
Codeforces Round #616 (Div. 2)
摘要：地址：http://codeforces.com/contest/1291 A题就不写解析了，就是给一个数，是不是本身满足这个条件或者删除某些数字来达到这个条件：奇数，各个位上的数字加起来是偶数。 #include<iostream> #include<cstdio> #include<cstrin 阅读全文
posted @ 2020-02-05 22:12 liyexin 阅读(156) 评论(0) 推荐(0)