-
Notifications
You must be signed in to change notification settings - Fork 0
/
Rod Cutting .txt
52 lines (51 loc) · 1.23 KB
/
Rod Cutting .txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG
{
public static void main (String[] args) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringBuffer sb=new StringBuffer();
int T=Integer.parseInt(br.readLine());
while(T-->0)
{
int n=Integer.parseInt(br.readLine());
String[] s=br.readLine().split("\\s");
int[] arr=new int[n];
for(int i=0;i<n;i++)
{
arr[i]=Integer.parseInt(s[i]);
}
int[][] dp=new int[n+1][n+1];
for(int[] x:dp)
{
Arrays.fill(x,-1);
}
sb.append(rodcut(arr,0,n,dp)+"\n");
}
System.out.print(sb);
}
public static int rodcut(int[] arr,int i,int rodlen,int[][] dp)
{
if(i==arr.length)
{
return 0;
}
if(rodlen==0)
{
return 0;
}
if(dp[i][rodlen]!=-1)
{
return dp[i][rodlen];
}
int smalloutput1=0,smalloutput2=0;
if(rodlen-i-1>=0)
{
smalloutput1=arr[i]+rodcut(arr,i,rodlen-i-1,dp);
}
smalloutput2=rodcut(arr,i+1,rodlen,dp);
return dp[i][rodlen]=Math.max(smalloutput1,smalloutput2);
}
}