南阳oj贪心算法之color the fence

最新推荐文章于 2024-12-26 21:29:22 发布

原创最新推荐文章于 2024-12-26 21:29:22 发布 · 505 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#贪心算法

刷题专栏收录该内容

71 篇文章

订阅专栏

在本篇博客中，我们探讨了一个有趣的编程问题：Tom如何利用有限的油漆在对面Mary家的围栏上写下最大的数字，以表达他的爱意。考虑到Mary不喜欢数字0，且每个数字消耗的油漆量不同，我们需要找到最优的解决方案。通过分析，我们提供了一段C++代码，展示了如何在给定油漆量的情况下，计算并输出Tom可以写的最大数字。

/**
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
5 4 3 2 1 2 3 4 5
2
9 11 1 12 5 8 9 10 6
样例输出
55555
33
*/
#include<iostream>
#define maxsize 1000000
using namespace std;
int main()
{
	int n;
	while(cin>>n)
	{
		int i,j,a[10],min=maxsize;
		for(i=1;i<=9;i++)
			cin>>a[i];
		for(i=1;i<=9;i++)
			if(min>a[i])
				min=a[i];
		if(min>n)
		{
			cout<<-1<<endl;
			continue;
		}
		for(i=n/min;i>0;i--)
		{
			for(j=9;j>0;j--)
			{
				if(n>=a[j]&&(n-a[j])/min+1>=i)
				{
					cout<<j;
					n-=a[j];
					break; 
				}
			}
		}
		cout<<endl;
	}
	return 0;
}