nyoj 791 Color the fence

最新推荐文章于 2020-03-22 12:22:49 发布

黄小鱼ZZZ

最新推荐文章于 2020-03-22 12:22:49 发布

阅读量629

点赞数

CC 4.0 BY-SA版权

分类专栏：基础算法

本文链接：https://blog.youkuaiyun.com/wojiaohuangyu/article/details/41314517

基础算法专栏收录该内容

183 篇文章

订阅专栏

Tom为了向Mary表达爱意，打算用油漆在对面围栏上写下最大数字。由于油漆数量有限且Mary不喜欢数字0，Tom面临如何用最少的油漆写出最大数字的问题。本篇介绍了一种贪心算法解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

描述

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.

样例输入

55 4 3 2 1 2 3 4 529 11 1 12 5 8 9 10 6

样例输出

5555533贪心算法，输出的那一部分是难点。。。。
代码：
#include<stdio.h>
#include<string.h>
int main(){
	int i,j,k,t;
	int a[10009];
	int n;
	int min;
	while(~scanf("%d",&n)){
		min=0x3f3f3f3f;
		for(i=0;i<9;i++){
			scanf("%d",&a[i]);
			if(min>a[i])
			  min=a[i];
		}
		if(n<a[i]){
			printf("-1\n");//判断，如果不要符合条件的话直接退出 
			continue;
		}
		for(i=n/min;i>=0;i--){
			for(j=8;j>=0;j--){
				if(n>=a[j]&&(n-a[j])/min>=i){//从最大的数开始涂，如果满足大于等于i就执行。 
					n-=a[j];
					printf("%d",j+1);
					break;
				}
			}
		}
		printf("\n");
	}
	return 0;
}