zoukankan      html  css  js  c++  java
  • geeksforgeeks@ Minimum Points To Reach Destination (Dynamic Programming)

    http://www.practice.geeksforgeeks.org/problem-page.php?pid=91

    Minimum Points To Reach Destination

    Given a grid with each cell consisting of positive, negative or no points i.e, zero points. We can move across a cell only if we have positive points ( > 0 ). Whenever we pass through a cell, points in that cell are added to our overall points. We need to find minimum initial points to reach cell (m-1, n-1) from (0, 0) by following these certain set of rules :
     
    1.From a cell (i, j) we can move to (i+1, j) or (i, j+1).
    2.We cannot move from (i, j) if your overall points at (i, j) is <= 0.
    3.We have to reach at (n-1, m-1) with minimum positive points i.e., > 0.
     
    Example:
     
    Input: points[m][n] = { {-2, -3,   3},  
                            {-5, -10,  1},  
                            {10,  30, -5}  
                          };
    Output: 7
    Explanation:  
    7 is the minimum value to reach destination with  
    positive throughout the path. Below is the path.
     
    (0,0) -> (0,1) -> (0,2) -> (1, 2) -> (2, 2)
     
    We start from (0, 0) with 7, we reach(0, 1)  
    with 5, (0, 2) with 2, (1, 2) with 5, (2, 2)
    with and finally we have 1 point (we needed  
    greater than 0 points at the end).

    Input:

    The first line contains an integer 'T' denoting the total number of test cases.
    In each test cases, the first line contains two integer 'R' and 'C' denoting the number of rows and column of array.  
    The second line contains the value of the array i.e the grid, in a single line separated by spaces in row major order.


    Output:

    Print the minimum initial points to reach the bottom right most cell in a separate line.


    Constraints:

    1 ≤ T ≤ 30
    1 ≤ R,C ≤ 10
    -30 ≤ A[R][C] ≤ 30


    Example:

    Input:
    1
    3 3
    -2 -3 3 -5 -10 1 10 30 -5
    Output:
    7

    import java.util.*;
    import java.lang.*;
    import java.io.*;
    
    class GFG {
        
        public static int func(int[][] arr) {
            
            int r = arr.length, c = arr[0].length;
            int[][] dp = new int[r][c];
            
            dp[r-1][c-1] = (1 + arr[r-1][c-1] <= 0)? 1: (1 + arr[r-1][c-1]);
            for(int j=c-2; j>=0; --j) {
                dp[r-1][j] = (dp[r-1][j+1] + arr[r-1][j] <= 0)? 1: (dp[r-1][j+1] + arr[r-1][j]);
            }
            
            for(int i=r-2; i>=0; --i) {
                dp[i][c-1] = (dp[i+1][c-1] + arr[i][c-1] <= 0)? 1: (dp[i+1][c-1] + arr[i][c-1]);
            }
            
            for(int i=r-2; i>=0; --i) {
                for(int j=c-2; j>=0; --j) {
                    int mmin = Integer.MAX_VALUE;
                    if(dp[i+1][j] + arr[i][j] <= 0 || dp[i][j+1] + arr[i][j] <= 0)  mmin = 1;
                    else mmin = Math.min(mmin, Math.min(dp[i+1][j], dp[i][j+1]) + arr[i][j]);
                    dp[i][j] = mmin;
                }
            }
            
            return dp[0][0];
        }
        
        public static void main (String[] args) {
            Scanner in = new Scanner(System.in);
            int times = in.nextInt();
            
            while(times > 0) {
                --times;
                
                int r = in.nextInt(), c = in.nextInt();
                int[][] arr = new int[r][c];
                for(int i=0; i<r; ++i) {
                    for(int j=0; j<c; ++j) {
                        arr[i][j] = in.nextInt();
                        arr[i][j] *= -1;
                    }
                }
                
                System.out.println(func(arr));
            }
        }
    }
    View Code
  • 相关阅读:
    基于Linux OpenJDK Debian的发行版的JAVA_HOME环境变量的正确目标是什么?
    redhat linux卸载默认的openjdk与安装sun的jdk
    更换介质:请把标有…… DVD 的盘片插入驱动器“/media/cdrom/”再按回车键“ 解决方法
    mysql 导出表结构和表数据 mysqldump用法
    转怎么让VI支持中文显示
    debian 更换sh的默认链接为bash
    基于percona-monitoring-plugins实现Zabbix的MySQL多端口自动发现监控
    elasticsearch中client.transport.sniff的使用方法和注意事项
    网络大数据分析 -- 使用 ElasticSearch + LogStash + Kibana 来可视化网络流量
    Parsing Netflow using Kibana via Logstash to ElasticSearch
  • 原文地址:https://www.cnblogs.com/fu11211129/p/5642206.html
Copyright © 2011-2022 走看看