diff options
| author | Yuqian Yang <crupest@crupest.life> | 2025-02-12 15:55:21 +0800 |
|---|---|---|
| committer | Yuqian Yang <crupest@crupest.life> | 2025-02-12 16:04:50 +0800 |
| commit | 93ea69f427e3d8165d34bd6ca7b533666884f307 (patch) | |
| tree | 22fcaec20fcdad22afd01c4214ca5301e304e15f /works/solutions/leetcode/cpp/1052.cpp | |
| parent | 1ecfd0ab7f1f511268fd6404dbc110c3c277b48c (diff) | |
| parent | eb8beb49117289ba9181cbefe647c4aa44e6a0b1 (diff) | |
| download | crupest-93ea69f427e3d8165d34bd6ca7b533666884f307.tar.gz crupest-93ea69f427e3d8165d34bd6ca7b533666884f307.tar.bz2 crupest-93ea69f427e3d8165d34bd6ca7b533666884f307.zip | |
import(solutions): IMPORT crupest/solutions COMPLETE.
Diffstat (limited to 'works/solutions/leetcode/cpp/1052.cpp')
| -rw-r--r-- | works/solutions/leetcode/cpp/1052.cpp | 47 |
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;
+ }
+};
|