diff options
| author | crupest <crupest@outlook.com> | 2021-02-23 00:30:09 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-23 00:30:09 +0800 |
| commit | 1c0d578e58fe2d65990ee6264bb0ef3aed362922 (patch) | |
| tree | d03bc73d7ec91ed8f0bedbde2b775ccb9b33ac4b /works | |
| parent | a2978fc785720cbc43c9c2f0e86a94f848ec1cce (diff) | |
| download | crupest-1c0d578e58fe2d65990ee6264bb0ef3aed362922.tar.gz crupest-1c0d578e58fe2d65990ee6264bb0ef3aed362922.tar.bz2 crupest-1c0d578e58fe2d65990ee6264bb0ef3aed362922.zip | |
import(solutions): Add problem 1052.
Diffstat (limited to 'works')
| -rw-r--r-- | works/solutions/cpp/1052.cpp | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/works/solutions/cpp/1052.cpp b/works/solutions/cpp/1052.cpp new file mode 100644 index 0000000..583e217 --- /dev/null +++ b/works/solutions/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;
+ }
+};
|