aboutsummaryrefslogtreecommitdiff
path: root/works/solutions/leetcode/cpp/1052.cpp
diff options
context:
space:
mode:
authorcrupest <crupest@outlook.com>2021-02-23 21:07:19 +0800
committercrupest <crupest@outlook.com>2021-02-23 21:07:19 +0800
commite353213dfb73259a5d33cc6e9d5cd2373c683be9 (patch)
treee879936e7e9c62f9946249cdeb470afeef1c1500 /works/solutions/leetcode/cpp/1052.cpp
parent7e3e89a3f0ecc49c33334f423dbde3a5fdc57abd (diff)
downloadcrupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.gz
crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.bz2
crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.zip
import(solutions): Move leetcode solutions to subdir.
Diffstat (limited to 'works/solutions/leetcode/cpp/1052.cpp')
-rw-r--r--works/solutions/leetcode/cpp/1052.cpp47
1 files changed, 47 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/1052.cpp b/works/solutions/leetcode/cpp/1052.cpp
new file mode 100644
index 0000000..583e217
--- /dev/null
+++ b/works/solutions/leetcode/cpp/1052.cpp
@@ -0,0 +1,47 @@
+#include <algorithm>
+// #include <iostream>
+#include <vector>
+
+using std::vector;
+
+class Solution {
+public:
+ int maxSatisfied(vector<int> &customers, vector<int> &grumpy, int X) {
+ int customer_count = customers.size();
+
+ int total_customer_count = 0;
+ int total_unsatisfied_customer_count = 0;
+
+ for (int i = 0; i < X; i++) {
+ total_customer_count += customers[i];
+ if (grumpy[i]) {
+ total_unsatisfied_customer_count += customers[i];
+ }
+ }
+
+ int current_suppress_customer_count = total_unsatisfied_customer_count;
+ int max_suppress_customer_count = total_unsatisfied_customer_count;
+
+ for (int i = X; i < customer_count; i++) {
+ total_customer_count += customers[i];
+ if (grumpy[i]) {
+ total_unsatisfied_customer_count += customers[i];
+ current_suppress_customer_count += customers[i];
+ }
+
+ if (grumpy[i - X]) {
+ current_suppress_customer_count -= customers[i - X];
+ }
+
+ max_suppress_customer_count = std::max(max_suppress_customer_count,
+ current_suppress_customer_count);
+ }
+
+ // std::cout << total_customer_count << '\n';
+ // std::cout << total_unsatisfied_customer_count << '\n';
+ // std::cout << max_suppress_customer_count << '\n';
+
+ return total_customer_count - total_unsatisfied_customer_count +
+ max_suppress_customer_count;
+ }
+};