![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
J1nAB1n9
困困倦倦,浑浑噩噩
展开
-
AtCoder Beginner Contest 068 D - Decrease (Contestant ver.)
Time limit : 2sec / Memory limit : 256MBScore : 600 pointsProblem StatementWe have a sequence of length N consisting of non-negative integers. Consider performing the following opera原创 2017-07-30 15:11:46 · 298 阅读 · 0 评论 -
贪心基础 最大整数
问题 G: 最大整数时间限制: 1 Sec 内存限制: 128 MB提交: 67 解决: 18[提交][状态][讨论版]题目描述设有n个正整数(n≤20),将它们联接成一排,组成一个最大的多位整数。 例如:n=3时,3个整数13,312,343联接成的最大整数为:34331213 又如:n=4时,4个整数7,13,4,246联接成的最大整数为:7424613原创 2017-08-07 20:06:11 · 783 阅读 · 0 评论 -
UVa 11054 Wine trading in Gergovia (贪心)
As you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street,and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simpleenoug原创 2017-08-11 19:25:22 · 289 阅读 · 0 评论 -
uva 1615 Highway 高速公路 (贪心算法)
HighwayBob is a skilled engineer. He must design a highway that crosses a region with few villages. Since this region is quite unpopulated, he wants to minimize the number of exits from the highway. H原创 2017-08-20 19:58:34 · 694 阅读 · 0 评论 -
uva 1610 Party Games (贪心+STL字符串)
You’ve been invited to a party. The host wants to divide the guests into 2 teams for party games, withexactly the same number of guests on each team. She wants to be able to tell which guest is on whi原创 2017-08-14 14:02:30 · 341 阅读 · 0 评论 -
uva 12545 Bits Equalizer(贪心)
You are given two non-empty strings S and T of equal lengths. S contains the characters ‘0’, ‘1’and ‘?’, whereas T contains ‘0’ and ‘1’ only. Your task is to convert S into T in minimum number ofmoves原创 2017-08-14 17:53:12 · 349 阅读 · 0 评论 -
uva 1149 Bin Packing(贪心)
A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the samelength l and each item i has length li ≤ l. We look for a minimal number of bins q such that• each bin原创 2017-08-14 14:51:09 · 322 阅读 · 0 评论 -
uva 11491 Erasing and Winning 奖品的价值(贪心)
Juliano is a fan of the TV show Erasing and Winning, where participants are selected in a draw andreceive money for taking part in the show. In the show, the presenter writes a number of N digits原创 2017-08-14 19:42:59 · 343 阅读 · 0 评论