-
Notifications
You must be signed in to change notification settings - Fork 1
/
dp1.cpp
59 lines (54 loc) · 828 Bytes
/
dp1.cpp
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
53
54
55
56
57
58
59
#include<bits/stdc++.h>
using namespace std;
int i,j,t,smax,maxindex,m,n;
int maxi;
int main()
{
cin>>tum;
while(tum--)
{
cin>>n>>m;
int arr[n][m], dp[n][m];
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>arr[i][j];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(i==0)
dp[i][j]=arr[i][j];
else
{
if(j!=maxindex)
{
dp[i][j]=arr[i][j]+maxi;
}
else
{
dp[i][j]=arr[i][j]+smax;
}
}
}//end of inner for loop
maxi=0,smax=0;
for(j=0;j<m;j++)
{
if(dp[i][j]>maxi)
{
maxi=dp[i][j];
maxindex=j;
}
}
for(j=0;j<m;j++)
{
if(j!=maxindex)
{
if(dp[i][j]>smax)
{
smax=dp[i][j];
}
}
}
}cout<<dp[n-1][m-1];
}
}