NYOJ 791 Color the fence

最新推荐文章于 2020-03-19 11:48:36 发布

Ruanran

最新推荐文章于 2020-03-19 11:48:36 发布

阅读量196

点赞数

CC 4.0 BY-SA版权

分类专栏： ---------贪心算法---------

本文链接：https://blog.youkuaiyun.com/zw792346763/article/details/79738837

---------贪心算法--------- 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一个名为Colorthefence的编程题，题目要求帮助Tom利用有限的油漆资源在围栏上写出最大的数字来赢得Mary的心。文章提供了一段AC代码，详细解释了解决方案的过程。

Color the fence

时间限制： 1000 ms | 内存限制： 65535 KB

难度：2

描述

Tom has fallen in love with Mary. Now Tom wants to show his love and write a number on the fence opposite to

Mary’s house. Tom thinks that the larger the numbers is, the more chance to win Mary’s heart he has.

Unfortunately, Tom could only get V liters paint. He did the math and concluded that digit i requires ai liters paint.

Besides,Tom heard that Mary doesn’t like zero.That’s why Tom won’t use them in his number.

Help Tom find the maximum number he can write on the fence.

输入

There are multiple test cases.
Each case the first line contains a nonnegative integer V(0≤V≤10^6).
The second line contains nine positive integers a1,a2,……，a9(1≤ai≤10^5).

输出

Printf the maximum number Tom can write on the fence. If he has too little paint for any digit, print -1.

样例输入

5 4 3 2 1 2 3 4 5

9 11 1 12 5 8 9 10 6

样例输出

来源

CodeForce

AC代码：

//在保证目标最长位数的情况下，将数字从高位到低位依次替换成尽可能大的数
#include <stdio.h>
int main()
{
int v;
int a[15];
while(~scanf("%d",&v))
{
for(int i=1;i<=9;i++)
scanf("%d",&a[i]);
int min=a[1];
for(int i=2;i<=9;i++)
if(a[i]<min) min=a[i];
int maxl=v/min;//能写出的数字的最长位数，即用总油漆量除以能写数字的最少用量
if(v<min) printf("-1\n");//连最小的数都写不了
else
{
while(1)
{
for(int i=9;i>=1;i--)
{
if(v<a[i]) continue;//必须判断，否则WA
else if((v-a[i])/min>=maxl-1)
//要保证写完这个数字，剩下的油漆还能保证最长位数
{
printf("%d",i);
v-=a[i];
maxl--;
break;
//一定要加break,不然会超时
//选取最大的数后，停止for循环，下次while循环仍从最大的数开始
//因为每个数可以多次使用
}
}
if(maxl==0) break;//目标最长位数够了，就停止循环
}
printf("\n");
}
}
return 0;
}