alogCode/reverseArray.cpp at master · SilverHL/alogCode · 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
#include <iostream>
#include <deque>

using namespace std;

int main()
{
    deque<int> deq;
    int temp;
    int n;
    int res = 0;

    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> temp;
        deq.push_back(temp);
    }

    while (!deq.empty())
    {
        if(deq.front() == deq.back())
        {
            deq.pop_front();
            deq.pop_back();
        } else if (deq.front() < deq.back())
        {
           int t = deq.front();
           deq.pop_front();
           t += deq.front();
           deq.pop_front();
           deq.push_front(t);
           res++;
        } else
        {
            int t = deq.back();
            deq.pop_back();
            t += deq.back();
            deq.pop_back();
            deq.push_back(t);
            res++;
        }
    }

    cout << res;
    return 0;
}