zoukankan      html  css  js  c++  java
  • ZOJ 3211 Dream City(线性DP)

    Dream City

    Time Limit: 1 Second      Memory Limit: 32768 KB

    JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are n trees in the yard. Let's call them tree 1, tree 2 ...and tree n. At the first day, each tree i has aicoins on it (i=1, 2, 3...n). Surprisingly, each tree i can grow bi new coins each day if it is not cut down. From the first day, JAVAMAN can choose to cut down one tree each day to get all the coins on it. Since he can stay in the Dream City for at most m days, he can cut down at most m trees in all and if he decides not to cut one day, he cannot cut any trees later. (In other words, he can only cut down trees for consecutive m or less days from the first day!)

    Given nmai and bi (i=1, 2, 3...n), calculate the maximum number of gold coins JAVAMAN can get.

    Input

    There are multiple test cases. The first line of input contains an integer T (T <= 200) indicates the number of test cases. Then T test cases follow.

    Each test case contains 3 lines: The first line of each test case contains 2 positive integers n and m (0 < m <= n <= 250) separated by a space. The second line of each test case contains n positive integers separated by a space, indicating ai. (0 < ai <= 100, i=1, 2, 3...n) The third line of each test case also contains n positive integers separated by a space, indicating bi. (0 < bi <= 100, i=1, 2, 3...n)

    Output

    For each test case, output the result in a single line.

    Sample Input

    2
    2 1
    10 10
    1 1
    2 2
    8 10
    2 3
    

    Sample Output

    10
    21
    

    Hints:
    Test case 1: JAVAMAN just cut tree 1 to get 10 gold coins at the first day.
    Test case 2: JAVAMAN cut tree 1 at the first day and tree 2 at the second day to get 8 + 10 + 3 = 21 gold coins in all.


    Author: CAO, Peng
    Source: The 6th Zhejiang Provincial Collegiate Programming Contest

    #include <iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    using namespace std;
    struct node
    {
        int s,grow;
    }a[256];
    int t,n,m;
    int dp[256][256];
    bool cmp(node a,node b)
    {
        return a.grow<b.grow;
    }
    
    int main()
    {
        while(~scanf("%d",&t))
        {
        for(;t>0;t--)
        {
            scanf("%d%d",&n,&m);
            for(int i=1;i<=n;i++)
                scanf("%d",&a[i].s);
            for(int i=1;i<=n;i++)
                scanf("%d",&a[i].grow);
            sort(a+1,a+n+1,cmp);
            memset(dp,0,sizeof(dp));
            for(int i=1;i<=n;i++)//dp[i][j]表示到第i棵树为止,砍了j棵获得的最多金币
                for(int j=1;j<=m;j++)
                dp[i][j]=max(dp[i][j],max(dp[i-1][j],dp[i-1][j-1]+a[i].s+(j-1)*a[i].grow));
    
            printf("%d
    ",dp[n][m]);
        }
        }
        return 0;
    }
  • 相关阅读:
    Hadoop生态圈
    Kafka原理总结
    多线程 Threading Multiprocessing(Python)
    多线程
    MySQL 基础操作
    Python3+RobotFramework自动化测试九:用Python写Roboot Framework测试
    Python3+RobotFramework自动化测试八:关键字封装
    Python3+RobotFramework自动化测试七:SeleniumLibrary web测试-百度搜索和邮箱登录
    Python3+RobotFramework自动化测试六:Selenium API
    Python3+RobotFramework自动化测试五:元素定位
  • 原文地址:https://www.cnblogs.com/stepping/p/6401176.html
Copyright © 2011-2022 走看看