• B. Color the Fence


    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output
     

    Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to win Tanya's heart he has.

    Unfortunately, Igor could only get v liters of paint. He did the math and concluded that digit d requires ad liters of paint. Besides, Igor heard that Tanya doesn't like zeroes. That's why Igor won't use them in his number.

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

    Input

    The first line contains a positive integer v (0 ≤ v ≤ 106). The second line contains nine positive integers a1, a2, ..., a(1 ≤ ai ≤ 105).

    Output

    Print the maximum number Igor can write on the fence. If he has too little paint for any digit (so, he cannot write anything), print -1.

    Examples
    input
    5
    5 4 3 2 1 2 3 4 5
    output
    55555
    input
    2
    9 11 1 12 5 8 9 10 6
    output
    33
    input
    0
    1 1 1 1 1 1 1 1 1
    output
    -1

    被这道题卡了蛮久,只考虑到了位数最大,没想到要尽可能小以给高位腾出更多空间。

    附AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int a[10];
     5 
     6 const int INF=1<<30;
     7 
     8 int main(){
     9     int v,temp=0;
    10     int Max=0;
    11     int Min=INF;
    12     cin>>v;
    13     for(int i=1;i<=9;i++){
    14         cin>>a[i];
    15         if(v/a[i]>Max||a[temp]==a[i]){
    16             Max=v/a[i];
    17             temp=i;
    18         }
    19         if(a[i]<=Min){
    20             Min=a[i];
    21         }
    22     }
    23     if(Max==0){
    24         cout<<-1<<endl;
    25         return 0;
    26     }
    27     else{
    28         int num=v/a[temp];
    29         
    30         Min=INF;
    31         for(int i=temp+1;i<=9;i++){
    32             if(a[i]<=Min){
    33                 Min=a[i];
    34             }
    35         }
    36         v%=a[temp];
    37         while(v>0&&v+a[temp]>=Min){
    38             int t;
    39             for(int i=9;i>temp;i--){
    40                 if(a[i]<=v+a[temp]){
    41                     cout<<i;
    42                     num--;
    43                     t=i;
    44                     break;
    45                 }
    46             }
    47             v-=abs(a[t]-a[temp]);
    48         }
    49         for(int i=0;i<num;i++){
    50             cout<<temp;
    51         }
    52         
    53         cout<<endl;
    54     }
    55     return 0;
    56 }
  • 相关阅读:
    [2011Summary Weekly]March.28April.1
    如何对需求分析人员进行考核测试角度
    算法实现三角形式输出C(n,k)
    Scrum 培训系列Scrum on a Page
    [练习]solveMaze
    excel中如何统计条件筛选后的条数
    开发人员绩效考核中"有效"bug数的统计
    Scrum 培训系列Scrum Lifecycle
    IIS6.0日志文件自定义类代码
    IIS6.0日志文件分析代码_3线程读取文件到数据库
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/5908627.html
Copyright © 2020-2023  润新知