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
#include<bits/stdc++.h>
using namespace std;

int check, kox, stonks, sum;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
    int a;
    cin>>a;
    int tab[a];
    for(int i=0; i<a; ++i)
    {
        cin>>tab[i];
    }
    for(int i=0; i<a-1; ++i)
    {
    	if(tab[0]>tab[1])
    	{
	        if(i%2==0&&tab[i]<=tab[i+1]&&tab[i]>=0)
	        {
	            ++sum;
	            tab[i+1]-=tab[i]+1;
	        }
	        else if(i%2==0&&tab[i]<=tab[i+1]&&tab[i]<0)
	        {
	            ++sum;
	            tab[i+1]+=tab[i];
	        }
	        else if(i%2!=0&&tab[i]>=tab[i+1]&&tab[i]>=0)
	        {
	            ++sum;
	            tab[i+1]-=tab[i]+1;
	        }
	        else if(i%2!=0&&tab[i]>=tab[i+1]&&tab[i]<0)
	        {
	            ++sum;
	            tab[i+1]+=tab[i];
	        }
		}
		else
		{
			if(i%2==0&&tab[i]>=tab[i+1]&&tab[i]>=0)
	        {
	            ++sum;
	            tab[i+1]-=tab[i]+1;
	        }
	        else if(i%2==0&&tab[i]>=tab[i+1]&&tab[i]<0)
	        {
	            ++sum;
	            tab[i+1]+=tab[i];
	        }
	        else if(i%2!=0&&tab[i]<=tab[i+1]&&tab[i]>=0)
	        {
	            ++sum;
	            tab[i+1]-=tab[i]+1;
	        }
	        else if(i%2!=0&&tab[i]<=tab[i+1]&&tab[i]<0)
	        {
	            ++sum;
	            tab[i+1]+=tab[i];
	        }
		}
    }
    cout<<sum;
    return 0;
}