dynamic-programming

问题 Find the number of paths on the Cartesian plane from (0, 0) to (n, n), which never raises above the y = x line. It is possible to make three types of moves along the path: move up, i.e. from (i, j) to (i, j + 1); move to the right, i.e. from (i, j) to (i + 1, j); the right-up move, i.e. from (i, j) to (i + 1, j + 1) 回答1: Path count 101 First, we solve a simpler problem: Find the number of paths on the Cartesian plane from (0, 0) to (n, n) with: move up, i.e. from (i, j) to (i, j + 1); move to

问题 I'm a beginner, and I'm trying to write a working travelling salesman problem using dynamic programming approach. This is the code for my compute function: public static int compute(int[] unvisitedSet, int dest) { if (unvisitedSet.length == 1) return distMtx[dest][unvisitedSet[0]]; int[] newSet = new int[unvisitedSet.length-1]; int distMin = Integer.MAX_VALUE; for (int i = 0; i < unvisitedSet.length; i++) { for (int j = 0; j < newSet.length; j++) { if (j < i) newSet[j] = unvisitedSet[j]; else

问题 I'm trying to find an algorithm to find K disjoint, contiguous subsets of size L of an array x of real numbers that maximize the sum of the elements. Spelling out the details, X is a set of N positive real numbers: X={x[1],x[2],...x[N]} where x[j]>=0 for all j=1,...,N. A contiguous subset of length L called S[i] is defined as L consecutive members of X starting at position n[i] and ending at position n[i]+L-1 : S[i] = {x[j] | j=n[i],n[i]+1,...,n[i]+L-1} = {x[n[i]],x[n[i]+1],...,x[n[i]+L-1]}.

问题 I have some form data and after submitting, a PDF is generated. The problem is size of tables in PDF. If some string in my form is too long the PDF is generated wrongly. It's because the tables. They have static size so if string is too long the table did not accommodate it. I use mPDF library. How can I make this tables size dynamics so as to their size changed depending on the length of string? If string {p} is longest then width of table the table size decrease. I want to if the string {p}

问题 I have a rectangular chocolate bar that consists of squares either black, white or mixed. The bar being not bigger than 50x50 squares. I'm supposed to divide the bar between two people(one gets all the white squares and one the black ones, mixed ones don't matter), by cracking it either horizontally or vertically. I'm supposed to find a method with the least amount of such cracks. I'm given this input: M N (number of rows, number of columns) and then M rows that are N numbers long(0 means

问题 I had generate a table in a string format and added in the body string mid = "<tr class='cart_item'>" + "<td class='product-remove'>" + " <a href='handler.ashx?id=" + id + "' class='remove' title='Remove this item'>×</a>" + "</td>" + " <td class='product-thumbnail'>" + " <a href='StoreDetails.aspx?id=" + id + "'>" + "<img src='" + thumb + "' " + "class='attachment-shop_thumbnail wp-post-image' alt='" + pname + "' /></a> </td>" + " <td class='product-name'>" + " <a href='StoreDetails.aspx?id="

问题 I'm trying to solve this problem. Now, I was able to get a recursive solution: If DP[n] gives the number of beautiful substrings (defined in problem) ending at the nth character of the string, then to find DP[n+1] , we scan the input string backward from the (n+1)th character until we find an ith character such that the substring beginning at the ith character and ending at the (n+1)th character is beautiful. If no such i can be found, DP[n+1] = 0 . If such a string is found then, DP[n+1] = 1

问题 This question already has answers here : Convert an array of strings, each string has dot separated values, to a multidimensional array (2 answers) Closed 3 years ago . I've a string like this: $str = "eat.fruit.apple.good"; I've to use this array like this: $arr["eat"]["fruit"]["apple"]["good"] = true; But I don't understand how can I create it dynamically. Thanks Davide 回答1: $str = "eat.fruit.apple.good"; // Set pointer at top of the array $arr = array(); $path = &$arr; // Path is joined by

问题 I have given Fibonacci digits only , i have to find out the numbers of ways to generate a number using K Fibonacci numbers only. Constraints: 1<=K<=10 1<=N<=10^9 For Example: N=14 and K=3 There are two ways: (8,5,1) and (8,3,3) Here is my recursive solution: public static void num_gen(int i ,long val ,int used){ if(used==0){ if(val==n) ans++; return ; } if(i==Fib.length) return ; for(int j=0;j<=used;j++){ long x = j*Fib[i]; if(x+val<=n){ num_gen(i+1,x+val, used-j); } } } This solution will

问题 I want to add a computed value to an existing vector from within a loop in which the wanted vector is called from within the loop . that is im looking for some function that is similar to assign() function but that will enable me to add values to an existing variables and not creating new variables. example: say I have 3 variabels : sp=3 for(i in 1:sp){ name<-paste("sp",i,sep="") assign(name,rnorm(5)) } and now I want to access the last value in each of the variabels, double it and add the