题目链接:http://codeforces.com/problemset/problem/761/C
暴力DP
#include<bits/stdc++.h>
#include<iostream>
using namespace std;#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e2+5;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);
}
char s[maxn][maxn];
int val[maxn][3],dp[maxn][8];
int n,m,ans,INF;
int judge(char c){if(c<='z'&&c>='a') return 0;else if(c<='9'&&c>='0') return 1;else if(c=='&'||c=='*'||c=='#') return 2;else return -1;
}
int main(){cin>>n>>m;rep(i,1,n+1) scanf("%s",s[i]);mst(dp,0xf),INF=dp[0][0];ans=INF,dp[0][0]=0;rep(i,1,n+1){mst(val[i],0xf);memcpy(dp[i],dp[i-1],sizeof(dp[i]));rep(k,0,m){int p=judge(s[i][k]);val[i][p]=min(val[i][p],min(k,m-k));}rep(j,0,7) rep(k,0,3) if(!(j&(1<<k)))dp[i][j|(1<<k)]=min(dp[i][j|(1<<k)],dp[i-1][j]+val[i][k]);///cout<<val[i][0]<<" "<<val[i][1]<<" "<<val[i][2]<<" "<<dp[i][7]<<endl;}printf("%d\n",dp[n][7]);return 0;
}