CodeForces/A_Cut_the_Array.cpp at master · Ash8389/CodeForces · 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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve()
{
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        int t;
        cin >> t;

        a[i] = t % 3;
    }

    vector<int> pre(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        pre[i] = (pre[i - 1] + a[i - 1]) % 3;
    }

    int l = 0, r = 0;

    for (int i = 1; i <= n - 2 && !l; i++)
    {
        for (int j = i + 1; j <= n - 1; j++)
        {
            int p1 = pre[i];
            int p2 = (pre[j] - pre[i] + 3) % 3;
            int p3 = (pre[n] - pre[j] + 3) % 3;

            if ((p1 == p2 && p2 == p3) || (p1 != p2 && p1 != p3 && p2 != p3))
            {
                l = i;
                r = j;
                break;
            }
        }
    }

    if (l)
        cout << l << " " << r << "\n";
    else
        cout << 0 << " " << 0 << "\n";
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}