- 博客(10)
- 收藏
- 关注
原创 ZOJ_1918 Ferry Loading II(动态规划)
Ferry Loading IITime Limit: 2000 msMemory Limit: 65536 KBProblem DescriptionBefore bridges were common, ferries were used to transport cars across rivers. River ferries, unlike their larger cousins, run on a guide line and are powered by the river’s cu
2020-07-31 23:41:12 199
原创 POJ_1011 Sticks(搜索)
SticksTime Limit: 1000MS Memory Limit: 10000KProblem DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many stick
2020-07-30 20:08:53 150
原创 ZOJ_1903 Jogging Trails(Floyd+DFS)
Jogging TrailsTime Limit: 2000 msMemory Limit: 65536 KBProblem DescriptionGord is training for a marathon. Behind his house is a park with a large network of jogging trails connecting water stations. Gord wants to find the shortest jogging route that t
2020-07-28 20:20:17 208
原创 ZOJ_1901 A Star not a Tree?(模拟退火)
A Star not a Tree?Time Limit: 2000 msMemory Limit: 65536 KBProblem DescriptionLuke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to connect any number of computers tog
2020-07-27 18:26:26 152
原创 CodeForces_1381B Unmerge(动态规划)
Unmergetime limit per test:1 secondsmemory limit per test:256 megabytesProblem DescriptionLet aaa and bbb be two arrays of lengths nnn and mmm, respectively, with no elements in common. We can define a new array merge(a,b)(a,b)(a,b) of length n+mn+mn+m
2020-07-24 15:14:50 237
原创 CodeForces_1379C Choosing flowers(贪心)
Choosing flowerstime limit per test:1 secondsmemory limit per test:512 megabytesProblem DescriptionVladimir would like to prepare a present for his wife: they have an anniversary! He decided to buy her exactly nnn flowers.Vladimir went to a flower sho
2020-07-21 18:08:38 436
原创 CodeForces_1385F Removing Leaves(贪心)
Removing Leavestime limit per test:2 secondsmemory limit per test:256 megabytesProblem DescriptionYou are given a tree (connected graph without cycles) consisting of nnn vertices. The tree is unrooted — it is just a connected undirected graph without c
2020-07-19 10:20:33 165
原创 ZOJ_3798 Abs Problem(构造)
Abs ProblemTime Limit: 2000 msMemory Limit: 65536 KBProblem DescriptionAlice and Bob is playing a game, and this time the game is all about the absolute value!Alice has N different positive integers, and each number is not greater than N. Bob has a lo
2020-07-16 17:38:48 77
原创 ZOJ_3724 Delivery(线段树)
DeliveryTime Limit: 6000 msMemory Limit: 65536 KBProblem DescriptionKarl is an impatient guy. He always wants to find the fastest way to solve any problem. As a delivery man, it’s a very good personality because he can make the work more efficient.Now
2020-07-14 09:46:20 142
原创 CodeForces_1375E Sum of Digits(暴力+贪心)
Sum of Digitstime limit per test:2 secondsmemory limit per test:512 megabytesProblem DescriptionLet f(x)f(x)f(x) be the sum of digits of a decimal number x.Find the smallest non-negative integer xxx such that f(x)+f(x+1)+⋯+f(x+k)=nf(x)+f(x+1)+⋯+f(x+k)
2020-07-06 21:44:48 346
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人