zoukankan      html  css  js  c++  java
  • Codeforces Round #241 (Div. 2) B. Art Union 基础dp

    B. Art Union
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A well-known art union called "Kalevich is Alive!" manufactures objects d'art (pictures). The union consists of n painters who decided to organize their work as follows.

    Each painter uses only the color that was assigned to him. The colors are distinct for all painters. Let's assume that the first painter uses color 1, the second one uses color 2, and so on. Each picture will contain all these n colors. Adding the j-th color to the i-th picture takes the j-th painter tij units of time.

    Order is important everywhere, so the painters' work is ordered by the following rules:

    • Each picture is first painted by the first painter, then by the second one, and so on. That is, after the j-th painter finishes working on the picture, it must go to the (j + 1)-th painter (if j < n);
    • each painter works on the pictures in some order: first, he paints the first picture, then he paints the second picture and so on;
    • each painter can simultaneously work on at most one picture. However, the painters don't need any time to have a rest;
    • as soon as the j-th painter finishes his part of working on the picture, the picture immediately becomes available to the next painter.

    Given that the painters start working at time 0, find for each picture the time when it is ready for sale.

    Input

    The first line of the input contains integers m, n (1 ≤ m ≤ 50000, 1 ≤ n ≤ 5), where m is the number of pictures and n is the number of painters. Then follow the descriptions of the pictures, one per line. Each line contains n integers ti1, ti2, ..., tin (1 ≤ tij ≤ 1000), where tijis the time the j-th painter needs to work on the i-th picture.

    Output

    Print the sequence of m integers r1, r2, ..., rm, where ri is the moment when the n-th painter stopped working on the i-th picture.

    Examples
    input
    5 1
    1
    2
    3
    4
    5
    output
    1 3 6 10 15 
    input
    4 2
    2 5
    3 1
    5 3
    10 1
    output
    7 8 13 21 
    思路:dp[i][t]=max(dp[i][t-1],dp[i-1][t])+a[i][t];
    #include<bits/stdc++.h>
    using namespace std;
    #define ll __int64
    #define mod 1000000007
    #define esp 0.00000000001
    const int N=5e4+10,M=1e6+10,inf=1e9;
    int dp[N][10];
    int a[N][10];
    int main()
    {
        int x,y,z,i,t;
        scanf("%d%d",&x,&y);
        for(i=1;i<=x;i++)
        for(t=1;t<=y;t++)
        scanf("%d",&a[i][t]);
        for(i=1;i<=x;i++)
        {
            for(t=1;t<=y;t++)
            dp[i][t]=max(dp[i][t-1],dp[i-1][t])+a[i][t];
        }
        for(i=1;i<=x;i++)
        cout<<dp[i][y]<<" ";
        return 0;
    }
  • 相关阅读:
    MTK 官方 openwrt SDK 使用
    PF_RING packet overwrites
    pycares cffi
    libevent evbuffer bug
    浮点转字符串性能比较
    重写 libev 的 EV_WIN32_HANDLE_TO_FD
    thrift TNonblockingServer 使用
    accel-pptp 部署
    boost::asio 使用 libcurl
    蜂鸟A20开发板刷 cubietruck 的 SD 卡固件
  • 原文地址:https://www.cnblogs.com/jhz033/p/5635721.html
Copyright © 2011-2022 走看看