FEFU_second_semester/B0.cpp at main · IMCT-FEFU-writeups/FEFU_second_semester · 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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int flower[n];
    for (int i = 0; i < n; i++)
    {
        cin >> flower[i];
    }
    int pref[n];
    pref[0] = flower[0];
    for (int i = 1; i < n; i++)
    {
        pref[i] = flower[i] + pref[i - 1];
    }
    int L = 0, M = 0, R = 0, sum = 0;
    for (int m = 0; m < n - 1; m++)
    {
        int l = 0, r = n - 1;
        int left_sum = pref[m];
        int right_sum = pref[r] - pref[m];
        while (l <= m && r > m)
        {
            if (left_sum == right_sum)
            {
                if (left_sum > sum)
                {
                    sum = left_sum;
                    L = l + 1;
                    M = m + 1;
                    R = r + 1;
                }
                break;
            }
            else if (left_sum > right_sum)
            {
                right_sum -= flower[];
            }
            else
            {
                left_sum -= flower[l++];
            }
        }
    }
    if (sum > 0)
    {
        cout << L << " " << M << " " << R;
    }
    else
    {
        cout << "-1";
    }
}

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int flower[n];
    for (int i = 0; i < n; i++)
    {
        cin >> flower[i];
    }
    int pref[n];
    pref[0] = flower[0];
    for (int i = 1; i < n; i++)
    {
        pref[i] = pref[i - 1] + flower[i];
    }
    int L = 0, M = 0, R = 0, sum = 0;
    for (int m = 0; m < (n - 1); m++)
    {
        int l = 0, r = n - 1;
        int left_sum = pref[m];
        int right_sum = pref[r] - pref[m];
        while (l <= m && r > m)
        {
            if (left_sum == right_sum)
            {
                if (left_sum > sum)
                {
                    sum = left_sum;
                    L = l + 1;
                    M = m + 1;
                    R = r + 1;
                }
                break;
            }
            else if (left_sum < right_sum)
            {
                right_sum -= flower[r--];
            }
            else
            {
                left_sum -= flower[l++];
            }
        }
    }
    if (sum > 0)
        cout << L << " " << M << " " << R;
    else
        cout << "-1";
    return 0;
}