#include <vector>
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
#define SZ(X) ((int)X.size())
#define pb push_back
const int N = 50009;
int a[N];
int dp[N][40];
int main()
{
int t, w;
cin >> t >> w;
for(int i = 1; i <= t; i++){
cin >> a[i];
}
if(a[1] == 1){
dp[1][0] = 1;
dp[1][1] = 0;
} else{
dp[1][0] = 0;
dp[1][1] = 1;
}
int pos = 1;
for(int i = 2; i <= t; i++){
for(int j = 0; j <= w; j++){
if(j == 0){
dp[i][j] = dp[i-1][j] + a[i]%2;
continue;
}
dp[i][j] = dp[i-1][j] > dp[i-1][j-1] ? dp[i-1][j] : dp[i-1][j-1];
if((j&1) + 1 == a[i]){
dp[i][j]++;
}
}
}
int ans = dp[t][0];
for(int i = 0; i <= w; i++){
ans = max(ans, dp[t][i]);
}
cout << ans << endl;
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
#define SZ(X) ((int)X.size())
#define pb push_back
const int N = 50009;
int a[N];
int dp[N][40];
int main()
{
int t, w;
cin >> t >> w;
for(int i = 1; i <= t; i++){
cin >> a[i];
}
if(a[1] == 1){
dp[1][0] = 1;
dp[1][1] = 0;
} else{
dp[1][0] = 0;
dp[1][1] = 1;
}
int pos = 1;
for(int i = 2; i <= t; i++){
for(int j = 0; j <= w; j++){
if(j == 0){
dp[i][j] = dp[i-1][j] + a[i]%2;
continue;
}
dp[i][j] = dp[i-1][j] > dp[i-1][j-1] ? dp[i-1][j] : dp[i-1][j-1];
if((j&1) + 1 == a[i]){
dp[i][j]++;
}
}
}
int ans = dp[t][0];
for(int i = 0; i <= w; i++){
ans = max(ans, dp[t][i]);
}
cout << ans << endl;
}
j&1 + 1 和 (j&1)+1 结果是不同的 因为&运算优先级比+小