TechGig/maximum_sum_path.cpp at master · atharv1703/TechGig · GitHub

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
using namespace std;


int max(int x, int y) { return (x > y) ? x : y; }


int maxPathSum(int ar1[], int ar2[], int m, int n)
{

    int i = 0, j = 0;


    int result = 0, sum1 = 0, sum2 = 0;


    while (i < m && j < n)
    {

        if (ar1[i] < ar2[j])
            sum1 += ar1[i++];


        else if (ar1[i] > ar2[j])
            sum2 += ar2[j++];

        else
        {

            result += max(sum1, sum2);


            sum1 = 0, sum2 = 0;


            int temp = i;
            while (i < m && ar1[i] == ar2[j])
                sum1 += ar1[i++];

            while (j < n && ar1[temp] == ar2[j])
                sum2 += ar2[j++];

            result += max(sum1, sum2);

            sum1 = 0, sum2 = 0;
        }
    }


    while (i < m)
        sum1 += ar1[i++];


    while (j < n)
        sum2 += ar2[j++];


    result += max(sum1, sum2);

    return result;
}
int main()
{
    int p,q;
    cin >>p;
    int ar1[p];
    for(int i=0;i<p;i++)
    cin >> ar1[i];
    cin >>q;
    int ar2[q];
    for(int i=0;i<q;i++)
    cin >> ar2[i];

    int m = sizeof(ar1) / sizeof(ar1[0]);
    int n = sizeof(ar2) / sizeof(ar2[0]);


    cout << maxPathSum(ar1, ar2, m, n);
    return 0;
}