-
Notifications
You must be signed in to change notification settings - Fork 0
/
practice.cpp
75 lines (63 loc) · 1.58 KB
/
practice.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
#include <bits/stdc++.h>
using namespace std;
int maxNum1(int arr[], int n, int m) {
int curr;
int mx;
queue<int> q;
int count = 0;
int i = 0;
while(i < n) {
if(count == m && arr[i] == 0) {
break;
}
if(count < m || arr[i] == 1) {
curr++;
}
if(arr[i] == 0 && count < m) {
count++;
q.push(i);
}
i++;
}
mx = curr;
for(i; i<n; i++) {
if(arr[i] == 1) {
curr++;
}
else if(arr[i] == 0 && !q.empty()) {
int idx = q.front();
q.pop();
q.push(i);
curr = i-idx;
} else {
curr = 0;
}
mx = max(mx, curr);
}
return mx;
}
int main() {
int n = 11;
int m = 2;
int arr[] = {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1};
cout<<maxNum1(arr, n, m);
return 0;
}
//=======================================
/*
https://practice.geeksforgeeks.org/problems/maximize-number-of-1s0905/1
*/
//=======================================
// int n = 77;
// int m = 60;
// int arr[] = {0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0};
// cout<<maxNum1(arr, n, m);
//=======================================
// int n, m;
// cin>>n;
// int arr[n];
// for(int i=0; i<n; i++) {
// cin>>arr[i];
// }
// cin>>m;
// cout<<maxNum1(arr, n, m);