-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1176.cpp
60 lines (56 loc) · 1.69 KB
/
1176.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
__________________________________________________________________________________________________
sample 8 ms submission
static const auto s = [](){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
return nullptr;
}();
class Solution {
public:
int dietPlanPerformance(vector<int>& calories, int k, int lower, int upper) {
int T = 0;
int points = 0;
for(int i = 0; i < k && i < calories.size(); ++i) {
T += calories[i];
}
if(T > upper) ++points;
if(T < lower) --points;
for(int i = k; i < calories.size(); ++i) {
T += calories[i];
T -= calories[i-k];
if(T > upper) ++points;
if(T < lower) --points;
}
return points;
}
};
__________________________________________________________________________________________________
sample 12 ms submission
static auto _ = []() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0;
}();
class Solution {
public:
int dietPlanPerformance(vector<int>& calories, int k, int lower, int upper) {
int result = 0, base = 0;
for (int i = 0; i < k; ++i)
base += calories[i];
for (int i = 0; i < calories.size() - k; ++i) {
if (base < lower)
--result;
if (base > upper)
++result;
base -= calories[i];
base += calories[i + k];
}
if (base < lower)
--result;
if (base > upper)
++result;
return result;
}
};
__________________________________________________________________________________________________