BZOJ3367 [Usaco2004 Feb]The Big Game 球赛

傻逼题……

发出来就是凑凑文章数……

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 2510
#define MAXM 1010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
int n,m;
int f[MAXN];
int s1[MAXN],s2[MAXN];
int main(){
int i,j;
char o[2];
scanf("%d%d",&n,&m);
memset(f,0x3f,sizeof(f));
f[0]=0;
for(i=1;i<=n;i++){
scanf("%s",o);
s1[i]=s1[i-1]+(o[0]=='H');
s2[i]=s2[i-1]+(o[0]=='J');
for(j=0;j<i;j++){
if(!(s1[i]-s1[j])||!(s2[i]-s2[j])||abs(s1[i]-s1[j]-s2[i]+s2[j])<=m){
f[i]=min(f[i],f[j]+1);
}
}
}
printf("%d\n",f
);
return 0;
}

/*

*/