coding-problems/problems/codechef/SUBARRY/sol.cpp at master · NicoKNL/coding-problems · 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
#include <iostream>
#include <unordered_map>

using namespace std;

int main()
{
    int T;
    cin >> T;

    while (T--)
    {
        int N;
        cin >> N;

        long long lo, hi;
        cin >> lo;
        hi = lo;
        N--;

        while (N--)
        {
            long long tmp;
            cin >> tmp;
            lo = min(lo, tmp);
            hi = max(hi, tmp);
        }

        long long abs_hi = max(abs(lo), abs(hi));

        long long ans_max = abs_hi * abs_hi;

        long long ans_min;
        if (lo < 0 && hi < 0)
        {
            ans_min = hi * hi;
        }
        else if (lo < 0 && hi >= 0)
        {
            ans_min = lo * hi;
        }
        else
        {
            ans_min = lo * lo;
        }

        cout << ans_min << " " << ans_max << endl;
    }

    return 0;
}