![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
Z~柳
这个作者很懒,什么都没留下…
展开
-
SOSdp--1208F Bits And Pieces
SOSdp学于cf的一篇博客SOSDP 以下是对他的一些理解: 如cf博客中 引入一个问题:求F[x]=∑i∈xA[i]\sum\limits_{i∈x}A[i]i∈x∑A[i] 这里的i满足iii&x=iii ,即iii是xxx的子集。如F[1012101_21012]=A[1012101_21012]+A[1002100_21002]+A[0012001_20012]+A[0...原创 2020-01-14 00:24:04 · 179 阅读 · 0 评论 -
uva11389公车早晚班(贪心详解)
In a city there are n bus drivers. Also there are n morning bus routes and n afternoon bus routes with various lengths. Each driver is assigned one morning route and one evening route. For any driver,...原创 2019-02-14 20:42:35 · 538 阅读 · 0 评论 -
uva10382装喷头(贪心-变相最小覆盖问题)
n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is installed at the horizontal center line of the strip. For each sprinkler we are given its p...原创 2019-02-21 13:37:46 · 151 阅读 · 0 评论 -
UVA11264 钱币兑换(dp+贪心+详解)
Our dear Sultan is visiting a country where there are n different types of coin. He wants to collect as many different types of coin as you can. Now if he wants to withdraw X amount of money from a Ba...原创 2019-02-13 12:10:44 · 281 阅读 · 0 评论 -
UVA410(贪心)
The International Space Station contains many centrifuges in its labs. Each centrifuge will have some number © of chambers each of which can contain 0, 1, or 2 specimens. You are to write a program wh...原创 2019-02-24 10:18:45 · 171 阅读 · 0 评论 -
UVA10020(贪心--最小覆盖问题)
Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely cover the segment [0, M]. Input The first line is ...原创 2019-02-21 13:12:10 · 204 阅读 · 0 评论