-
Notifications
You must be signed in to change notification settings - Fork 0
/
movingavg.cpp
107 lines (89 loc) · 2.75 KB
/
movingavg.cpp
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
///////////////// ____ ___ _ _ _ *******************************
///////////////// | _ \_ _/ | || | *******************************
///////////////// | |_) | || | || |_ *******************************
///////////////// | __/| || |__ _| *******************************
///////////////// |_| |___|_| |_| *******************************
#include<bits/stdc++.h>
// #include<iostream>
// #include<vector>
// #include<stack>
// #include<queue>
// #include<unordered_map>
// #include<set>
// #include<algorithm>
using namespace std;
#define int int64_t
#define ll int
#define ull unsigned long long
#define GO_BABY_GO ios::sync_with_stdio(false); cin.tie(NULL);
#define endl "\n"
ll min(ll a, ll b) {return a<b?a:b;}
ll max(ll a, ll b) {return a>b?a:b;}
/**
* Limits in C++ for reference
* _____________________________________________________________________________________
* |Sr| Macro Name | Description | Value
* |No|____________|_________________________________|__________________________________
* |1.| ULLONG_MAX | Maximum value unsigned long long| 18,446,744,073,709,551,615 (10^20)
* |2.| LLONG_MAX | Maximum value long long | 9,223,372,036,854,775,807 (10^19)
* |3.| LLONG_MIN | Minimum value long long |-9,223,372,036,854,775,808 -1*(10^19)
* |4.| INT_MAX | Maximum value int | 2,147,483,647 (10^10)
* |5.| INT_MIN | Minimum value int |-2,147,483,648 (10^10)
*/
void solve() {
int a,b;
cin>>a>>b;
int n;
cin>>n;
vector<double> prices(n),sums(n+1,0);
for(int i=0;i<n;i++) {
cin>>prices[i];
sums[i+1] = sums[i] + prices[i];
}
vector<double> movAvX(n,0), movAvY(n,0);
for(int i=a-1;i<n;i++) {
movAvX[i] = (sums[i+1]-sums[i+1-a]) / a;
}
for(int i=b-1;i<n;i++) {
movAvY[i] = (sums[i+1]-sums[i+1-b]) / b;
}
// for(double i:movAvX) {
// cout<<i<<" ";
// }
// cout<<endl;
// for(double i:movAvY) {
// cout<<i<<" ";
// }
// cout<<endl;
int c = max(a,b) - 1;
while(c < n && movAvX[c] == movAvY[c]) c++;
if(c==n) {
cout<<0<<"";
return;
}
bool Xsmaller = movAvX[c] < movAvY[c];
int ret = 0;
for(int i=c+1;i<n;i++) {
if(movAvX[i] < movAvY[i]) {
if(!Xsmaller) {
ret++;
Xsmaller = true;
}
} else if(movAvX[i] > movAvY[i]) {
if(Xsmaller) {
ret++;
Xsmaller = false;
}
}
}
cout<<ret<<"";
}
int32_t main() {
GO_BABY_GO;
ll t = 1;
// cin>>t;
while(t--) {
solve();
}
return 0;
}