Hdu 2209 Turn Solitaire Game

is in accordance with the greedy ideas, divided into the first card to consider, the next time each search to see the front of a 0 or 1, 1 words on the turn, and finally look at the status of the last card.

#include <stdio.h>#include <algorithm>#include <string.h>using namespace STD;Const intinf=1<< -;intans,len,a[ -];Chars[ -];intDfsintCntintNow) {if(Now==len) {if(a[now-1]==0)returnCntElse returnInf }Else if(a[now-1]) {a[now-1]=!a[now-1];        A[now]=!a[now]; a[now+1]=!a[now+1];    cnt++; } DFS (cnt,now+1);}intMain () {intI while(~scanf('%s ', s)) {ans=inf; len=strlen(s); for(i=0; i<len; i++) a[i]=s[i]-' 0 '; a[0]=!a[0]; a[1]=!a[1]; Ans=min (Ans,dfs (1,1)); for(i=0; i<len; i++) a[i]=s[i]-' 0 '; Ans=min (Ans,dfs (0,1));if(Ans==inf)printf("no\n");Else printf("%d\n", ans); }return 0;}

Hdu 2209 Turn Solitaire Game