大桃桃 - 博客园

版本问题解决NoNodeAvailableException[None of the configured nodes are available

摘要： NoNodeAvailableException[None of the configured nodes are available: [{#transport#-1}{T1T83HHTRaSZ6nkUAPt93w}{192.168.1.100}{192.168.1.100:9300}]] spr 阅读全文

posted @ 2020-03-03 15:34 大桃桃阅读(2514) 评论(0) 推荐(0)

TZOJ 挑战题库随机训练02

摘要：点击题号跳转原H题不存在，所以只有9题 A5381 B5822 C1157 D5151 E5133F1369 G4170 H4733 I1147 A.C++实验：STL之search回到顶部题意 STL中的search函数，判断一个序列是否是另一个序列的子序列题解 STL search函数的使阅读全文

posted @ 2020-02-29 20:35 大桃桃阅读(356) 评论(0) 推荐(0)

TZOJ 挑战题库随机训练01

摘要：点击题号跳转 A2587 B2151 C4672 D4431 E3231 F3706 G3183 H3692 I2665 J1353 A.Toys回到顶部题意贝西生日到了，他想庆祝D([1,10^5])天，第i天需要Ti([1,50])个玩具庆祝，1个玩具Tc([1,60])美元，玩具使用过了会阅读全文

posted @ 2020-02-23 21:42 大桃桃阅读(647) 评论(0) 推荐(0)

TZOJ 2943 Running Median(动态中位数)

摘要：描述 For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-indexed value is read, output the med 阅读全文

posted @ 2020-02-14 23:36 大桃桃阅读(248) 评论(0) 推荐(0)

TZOJ 3927 Circular Sequence(环形最大子段和)

摘要：描述 Given a sequence with n elements, if the last element is also adjacent to the first element of the sequence, the sequence is called “circular seque 阅读全文

posted @ 2020-02-09 20:44 大桃桃阅读(220) 评论(0) 推荐(0)

TZOJ 3698 GCD depth(数学)

摘要：描述 In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more n 阅读全文

posted @ 2020-02-06 23:20 大桃桃阅读(269) 评论(0) 推荐(0)

TZOJ 1503 Incredible Cows(折半搜索+二分)

摘要：描述 Farmer John is well known for his great cows. Recently, the cows have decided to participate in the Incredible Cows Puzzle Contest (ICPC). Farmer J 阅读全文

posted @ 2019-11-29 21:02 大桃桃阅读(313) 评论(0) 推荐(1)

TZOJ 5963 Increasing Sequences(线性DP)

摘要：描述 Given a string of digits, insert commas to create a sequence of strictly increasing numbers so as to minimize the magnitude of the last number. For 阅读全文

posted @ 2019-10-31 16:16 大桃桃阅读(235) 评论(0) 推荐(0)

TZOJ 5962 Happy Matt Friends(计数DP)

摘要：描述 Matt hzs N friends. They are playing a game together.Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of h 阅读全文

posted @ 2019-10-31 13:55 大桃桃阅读(180) 评论(0) 推荐(0)

TZOJ 5110 Pollutant Control(边数最少最小割最小字典序输出)

摘要：描述 It's your first day in Quality Control at Merry Milk Makers, and already there's been a catastrophe: a shipment of bad milk has been sent out. Unfo 阅读全文

posted @ 2019-10-30 15:17 大桃桃阅读(217) 评论(0) 推荐(0)

TZOJ 4024 游戏人生之梦幻西游(连续子段和绝对值最小)

摘要：塔神酷爱玩梦幻西游这款游戏,这款游戏以著名的章回小说《西游记》故事为背景,透过Q版的人物,营造出浪漫的网络游戏风格.塔神以追求天下无敌为目标,从一个默默无闻的菜鸟,打拼到了登峰造极的大师,犀利的人物当然离不开犀利的装备,于是塔神带着一堆票子开始逛市场买装备,塔神为了图个方便,只会在连续的几家摊位买装阅读全文

posted @ 2019-10-28 21:24 大桃桃阅读(224) 评论(0) 推荐(0)

TZOJ 2965 A Coin Game(DP)

摘要：描述 Farmer John's cows like to play coin games so FJ has invented with a new two-player coin game called Xoinc for them. Initially a stack of N (5 ≤ N 阅读全文

posted @ 2019-10-16 20:32 大桃桃阅读(162) 评论(0) 推荐(0)

TZOJ 5094 Stringsobits(DP)

摘要：描述 Consider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1. This set of strings is interesting because it is 阅读全文

posted @ 2019-10-14 18:37 大桃桃阅读(126) 评论(0) 推荐(0)

TZOJ 3522 Checker Challenge(深搜)

摘要：描述 Examine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and each 阅读全文

posted @ 2019-10-11 10:45 大桃桃阅读(156) 评论(0) 推荐(0)

TZOJ 4292 Count the Trees(树hash)

摘要：描述 A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". A subtree of a 阅读全文

posted @ 2019-10-11 09:46 大桃桃阅读(190) 评论(0) 推荐(0)