![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
文章平均质量分 88
红鲤鱼遇绿鲤鱼
只要思想不滑坡,办法总比困难多~
展开
-
cf Educational Codeforces Round 134 E. Prefix Function Queries
cf 134 e kmp自动机原创 2023-01-20 20:12:50 · 1691 阅读 · 0 评论 -
cf Educational Codeforces Round 133 E. Swap and Maximum Block
cf 133 e原创 2022-09-17 11:11:35 · 227 阅读 · 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 · 152 阅读 · 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 · 282 阅读 · 0 评论 -
cf Educational Codeforces Round 80 E. Messenger Simulator
E. Messenger Simulatortime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is a frequent user of the very popular messenger. He’s chatting with his friends all the time. He has n friends, n原创 2020-06-07 17:16:56 · 176 阅读 · 0 评论 -
cf Educational Codeforces Round 65 C. News Distribution
原题:C. News Distributiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn some social network, there are n users communicating with each...原创 2020-03-22 18:18:47 · 408 阅读 · 0 评论 -
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 · 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 · 528 阅读 · 0 评论 -
cf Educational Codeforces Round 25 F. String Compression
Educational Codeforces Round 25F. String Compression原创 2017-08-28 13:17:04 · 470 阅读 · 0 评论 -
uva 455 Periodic Strings
uva 455 Periodic Strings原创 2017-07-22 22:19:28 · 700 阅读 · 0 评论 -
hdoj 1754 I Hate It
hdoj 1754 I Hate It原创 2016-07-25 16:08:38 · 274 阅读 · 0 评论 -
cf Educational Codeforces Round 41 E. Tufurama
原题: E. Tufurama time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output One day Polycarp decided to rewatch his absolute favourite episode of we...原创 2018-07-16 10:10:47 · 215 阅读 · 0 评论 -
线段树基本操作讲解
转载的线段树讲解转载 2016-07-23 00:29:28 · 849 阅读 · 1 评论 -
uva 10158 War
uva 10158 War种类并查集 向量偏移原创 2017-03-05 17:22:40 · 502 阅读 · 0 评论 -
uva 10608 Friends
uva 10608 Friends并查集原创 2017-02-22 10:32:51 · 1326 阅读 · 0 评论 -
LA 3027 Corporative Network
LA 3027 Corporative Network原创 2017-02-08 00:00:03 · 303 阅读 · 0 评论 -
LA 3644 X-Plosives
LA 3644 X-Plosives原创 2017-02-07 11:11:52 · 444 阅读 · 0 评论 -
uva 1395 Slim Span
原题: Given an undirected weighted graph G, you should find one of spanning trees specified as follows. The graph G is an ordered pair (V,E), where V is a set of vertices {v 1 ,v 2 ,…,v n } and E is a原创 2017-09-22 20:09:40 · 450 阅读 · 0 评论 -
uva 1151 Buy or Build
uva 1151 Buy or Build原创 2017-10-02 19:37:16 · 316 阅读 · 0 评论 -
uva 297 四分树
uva 297 Quadtrees原创 2016-01-17 16:04:52 · 519 阅读 · 0 评论 -
cf Codeforces Round #544
原题:F1. Spanning Tree with Maximum Degreetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected unweighted connected...原创 2019-08-25 11:17:59 · 184 阅读 · 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 · 198 阅读 · 0 评论 -
uva 11234 Expressions
原题: Arithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example, (x + y) ∗ (z − w) is an arithmetic expression in infix not...原创 2018-08-22 00:32:52 · 296 阅读 · 0 评论 -
uva 11111 Generalized Matrioshkas
原题: Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another...原创 2018-08-20 10:47:30 · 441 阅读 · 0 评论 -
cf Educational Codeforces Round 42 D. Merge Equals
原题: D. Merge Equals time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given an array of positive integers. While there are at leas...原创 2018-07-24 00:00:35 · 140 阅读 · 0 评论 -
Educational Codeforces Round 35 E. Stack Sorting
原题: E. Stack Sorting time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Let’s suppose you have an array a, a stack s (initially empty) and ...原创 2018-03-09 23:49:14 · 258 阅读 · 0 评论 -
hdoj 3065 病毒侵袭持续中
原题:Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16467 Accepted Submission(s): 5568Problem Description 小t非常感谢大家帮忙解决了他的上一个问题。然而病毒侵袭持续...原创 2018-02-28 18:08:20 · 306 阅读 · 0 评论 -
uva 11997 K Smallest Sums
uva 11997 K Smallest Sums原创 2017-02-06 23:55:32 · 338 阅读 · 0 评论 -
LA 3135 Argus
LA 3135 Argus原创 2017-02-05 23:43:03 · 381 阅读 · 0 评论 -
uva 699 The Falling Leaves
uva 699 The Falling Leaves原创 2016-02-18 21:57:06 · 415 阅读 · 0 评论 -
poj 3264 Balanced Lineup
poj 3264 Balanced Lineup原创 2016-02-02 01:41:20 · 301 阅读 · 0 评论 -
hdoj 2586 How far away ?
hdoj 2586 How far away ?转载 2016-02-07 16:16:45 · 378 阅读 · 0 评论 -
uva 712 S-Trees
uva 712 S-Trees原创 2016-01-27 01:24:30 · 387 阅读 · 0 评论 -
uva 10129 Play on Words
uva 10129 Play on Words原创 2016-01-05 12:34:53 · 401 阅读 · 0 评论 -
poj 1145 (uva 112) Tree Summing
poj 1145 Tree Summinguva 112原创 2015-12-31 02:41:25 · 569 阅读 · 0 评论 -
uva 10048 Audiophobia
uva 10048原创 2015-07-06 23:12:26 · 741 阅读 · 0 评论 -
uva 10397 Connect the Campus 把学校连起来
uva 10397原创 2015-07-19 12:41:33 · 525 阅读 · 0 评论 -
uva 10099 The Tourist Guide
uva 10099原创 2015-08-14 12:58:46 · 615 阅读 · 0 评论 -
uva 10308 Roads in the North 北方的道路
uva 10308原创 2015-07-30 20:08:51 · 2852 阅读 · 0 评论 -
uva 548 tree 树
uva 548 tree原创 2015-08-12 01:04:43 · 535 阅读 · 0 评论