根本不会/就差一点/记得再看
文章平均质量分 88
红鲤鱼遇绿鲤鱼
只要思想不滑坡,办法总比困难多~
展开
-
cf Educational Codeforces Round 141 D. Different Arrays
cf 141 d different arrays原创 2023-03-16 22:15:42 · 550 阅读 · 0 评论 -
cf Educational Codeforces Round 134 E. Prefix Function Queries
cf 134 e kmp自动机原创 2023-01-20 20:12:50 · 1722 阅读 · 0 评论 -
cf Educational Codeforces Round 133 C. Robot in a Hallway
cf 133 c dp原创 2022-09-13 16:51:19 · 258 阅读 · 0 评论 -
cf Educational Codeforces Round E. Boring Segments
原题:E. Boring Segmentstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given nsegments on a number line, numbered from 1 to n. The i-th segments covers all integer points from li to ri原创 2021-09-21 17:31:28 · 165 阅读 · 0 评论 -
cf Educational Codeforces Round D. Say No to Palindromes
原题:D. Say No to Palindromestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet’s call the string beautiful if it does not contain a substring of length at least 2 , which is a palindrome. Reca原创 2021-09-21 17:02:08 · 138 阅读 · 0 评论 -
洛谷 P4516 潜入行动
原题:外星人又双叒叕要攻打地球了,外星母舰已经向地球航行!这一次,JYY 已经联系好了黄金舰队,打算联合所有 JSOIer 抵御外星人的进攻。在黄金舰队就位之前,JYY 打算事先了解外星人的进攻计划。现在,携带了监听设备的特工已经秘密潜入了外星人的母舰,准备对外星人的通信实施监听。外星人的母舰可以看成是一棵 n 个节点、 n−1 条边的无向树,树上的节点用 1,2,⋯ ,n 编号。JYY 的特工已经装备了隐形模块,可以在外星人母舰中不受限制地活动,可以神不知鬼不觉地在节点上安装监听设备。如果在节点原创 2021-08-07 00:28:14 · 150 阅读 · 0 评论 -
poj 1463 Strategic game
原题:Strategic gameTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 13192 Accepted: 5971DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. N原创 2021-06-13 09:59:04 · 147 阅读 · 0 评论 -
hdoj 2196 Computer
原题:A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning原创 2021-06-13 09:42:29 · 158 阅读 · 0 评论 -
洛谷 1352 没有上司的舞会
** 原题:**题目描述某大学有 nnn 个职员,编号为 1…n1\ldots n1…n。他们之间有从属关系,也就是说他们的关系就像一棵以校长为根的树,父结点就是子结点的直接上司。现在有个周年庆宴会,宴会每邀请来一个职员都会增加一定的快乐指数 rir_iri,但是呢,如果某个职员的直接上司来参加舞会了,那么这个职员就无论如何也不肯来参加舞会了。所以,请你编程计算,邀请哪些职员可以使快乐指数最大,求最大的快乐指数。输入格式输入的第一行是一个整数 nnn。第 222 到第 (n+1)(n +原创 2021-06-13 08:29:17 · 177 阅读 · 0 评论 -
cf Educational Codeforces Round 106 E. Chaotic Merge
原题:E. Chaotic Mergetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two strings x and y, both consist only of lowercase Latin letters. Let |s| be the length of string s.Let’s cal原创 2021-05-25 00:03:18 · 170 阅读 · 0 评论 -
uva 323 Jury Compromise && poj 1015
原题:Jury CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37658 Accepted: 10214 Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general pub原创 2020-10-18 14:21:54 · 212 阅读 · 0 评论 -
cf Educational Codeforces Round 81 E. Permutation Separation
原题:E. Permutation Separationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p1,p2,…,pn (an array where each integer from 1 to n appears exactly once). The weight of原创 2020-08-23 18:29:39 · 299 阅读 · 0 评论 -
hdoj 2476 String painter
原题: There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a segment of characters of a string to any other character you want.原创 2020-06-26 16:38:26 · 380 阅读 · 0 评论 -
zoj 3469
原题:When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.Suppose there are N people livi...原创 2020-04-06 19:31:04 · 233 阅读 · 0 评论 -
LightOJ 1422 Halloween Costumes
原题:Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it’s Halloween, these parties are all costume parties,...原创 2020-03-14 23:48:59 · 309 阅读 · 0 评论 -
leetcode 1000 合并石头的最低成本
原题:有 N 堆石头排成一排,第 i 堆中有 stones[i] 块石头。每次移动(move)需要将连续的 K 堆石头合并为一堆,而这个移动的成本为这 K 堆石头的总数。找出把所有石头合并成一堆的最低成本。如果不可能,返回 -1 。示例 1:输入:stones = [3,2,4,1], K = 2输出:20解释:从 [3, 2, 4, 1] 开始。合并 [3, 2],成本为 5,...原创 2020-02-06 20:13:28 · 1039 阅读 · 1 评论 -
uva12166
原题:A mobile is a type of kinetic sculpture constructed to take advantage of the principle of equilibrium. It con-sists of a number of rods, from which weighted objects or further rods hang. The obje...原创 2020-01-27 23:12:51 · 297 阅读 · 0 评论 -
cf Educational Codeforces Round 77 E. Tournament
原题:E. Tournamenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are organizing a boxing tournament, where n boxers will participate (n i...原创 2020-01-25 01:35:47 · 286 阅读 · 0 评论 -
cf Educational Codeforces Round 79 C. Stack of Presents
原题:C. Stack of Presentstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSanta has to send presents to the kids. He has a large stack of n ...原创 2020-01-11 16:22:53 · 538 阅读 · 0 评论 -
cf Educational Codeforces Round 78 E. Tests for problem D
原题:E. Tests for problem Dtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe had a really tough time generating tests for problem D. In o...原创 2020-01-11 15:57:39 · 338 阅读 · 0 评论 -
cf Educational Codeforces Round 78 D. Segment Tree
原题:D. Segment Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs the name of the task implies, you are asked to do some work with se...原创 2020-01-11 15:38:06 · 266 阅读 · 0 评论 -
cf Educational Codeforces Round 63 D. Beautiful Array
原题:D. Beautiful Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array aconsisting of n integers. Beauty of array ...原创 2019-12-22 00:13:31 · 166 阅读 · 0 评论 -
uva 10306 e-Coin
uva 10306原创 2016-01-20 14:34:02 · 704 阅读 · 0 评论 -
cf Educational Codeforces Round 58 D. GCD Counting
原题:D. GCD Countingtime limit per test4.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a tree consisting of n vertices. A number is written on ea...原创 2019-04-24 17:38:30 · 271 阅读 · 0 评论 -
cf Educational Codeforces Round 57 D. Easy Problem
原题:D. Easy Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is preparing a contest, and now he has written a statement for an ea...原创 2019-04-03 21:14:15 · 304 阅读 · 0 评论 -
cf Educational Codeforces Round 55 E. Increasing Frequency
原题:E. Increasing Frequencytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given array a of length n. You can choose one segment [l,r...原创 2019-01-31 21:48:41 · 199 阅读 · 0 评论 -
cf Educational Codeforces Round 54 E. Vasya and a Tree
原题:E. Vasya and a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has a tree consisting of n vertices with root in vertex 1. At fi...原创 2018-12-16 19:30:20 · 212 阅读 · 0 评论 -
cf Educational Codeforces Round 53 D. Berland Fair
原题:D. Berland Fairtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputXXI Berland Annual Fair is coming really soon! Traditionally fair consists...原创 2018-11-29 22:19:48 · 405 阅读 · 0 评论 -
cf Educational Codeforces Round 60 C. Magic Ship
原题:C. Magic Shiptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou a captain of a ship. Initially you are standing in a point (x1,y1) (obvi...原创 2019-05-19 10:00:59 · 351 阅读 · 0 评论 -
cf Educational Codeforces Round 60 D. Magic Gems
原题:D. Magic Gemstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputReziba has many magic gems. Each magic gem can be split into M normal gems. ...原创 2019-05-19 11:15:40 · 316 阅读 · 0 评论 -
cf Educational Codeforces Round 61 C. Painting the Fence
原题:C. Painting the Fencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a long fence which consists of n sections. Unfortunately, i...原创 2019-06-30 19:52:46 · 306 阅读 · 0 评论 -
cf Educational Codeforces Round 61 D. Stressful Training
原题:D. Stressful Trainingtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland SU holds yet another training contest for its students today...原创 2019-06-30 20:13:16 · 364 阅读 · 0 评论 -
cf Educational Codeforces Round 61 E. Knapsack
原题:E. Knapsacktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a set of items, each having some integer weight not greater than 8. Y...原创 2019-06-30 21:12:22 · 238 阅读 · 0 评论 -
cf Educational Codeforces Round 61 F. Clear the String
原题:F. Clear the Stringtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s of length n consisting of lowercase Latin let...原创 2019-06-30 21:48:08 · 256 阅读 · 0 评论 -
cf Codeforces Round #544 F2. Spanning Tree with One Fixed Degree
原题:F2. Spanning Tree with One Fixed Degreetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected unweighted connect...原创 2019-08-25 11:27:16 · 194 阅读 · 0 评论 -
cf Educational Codeforces Round 53 C. Vasya and Robot
原题:C. Vasya and Robottime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has got a robot which is situated on an infinite Cartesian plane, ...原创 2018-11-29 21:50:56 · 203 阅读 · 0 评论 -
cf Educational Codeforces Round 52 D. Three Pieces
原题:D. Three Piecestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou stumbled upon a new kind of chess puzzles. The chessboard you are give...原创 2018-10-15 23:49:00 · 339 阅读 · 0 评论 -
cf Educational Codeforces Round 50 C. Classy Numbers
原题:C. Classy Numberstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet’s call some positive integer classy if its decimal representation co...原创 2018-10-08 16:26:24 · 250 阅读 · 0 评论 -
uva 10090 So you want to be a 2n-aire?
uva 10090 So you want to be a 2n-aire?原创 2016-03-08 16:14:29 · 475 阅读 · 0 评论 -
uva 10626 Buying Coke
uva 10626 Buying Coke原创 2017-02-13 10:39:14 · 423 阅读 · 0 评论