传送门
思路:观察可知,找出每个分割点标记,最后01背包处理即可。(或排序贪心)
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000];
int fgd[1000];
int dp[1000];
int main()
{
int n, m;
cin >> n >> m;
int cnj = 0, cno = 0;
int cnt = 0;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
}
for(int i = 1; i <= n; i++)
{
if(a[i] & 1 == 1)
cnj++;
else cno++;
if(cnj == cno && i != n)
{
fgd[++cnt] = abs(a[i + 1] - a[i]);
}
}
for(int i = 1; i <= cnt; i++)
for(int j = m; j >= fgd[i]; j--)
dp[j] = max(dp[j], dp[j - fgd[i]] + 1);
cout << dp[m] << endl;
return 0;
}