取珠子问题.doc

取珠子问题一#include#includeint count(char *s)int i=0,c,len;len=strlen(s);c=1;while(1)if(si!=si+1)break;elsec+;i+;if(c=len)return c;i=len-1;c+;while(1)if(si!=si-1)break;elsec+;i-;return c;main()char t,s100;int i,j,len,c,k;printf(请输入环上珠子颜色字符串:n);scanf(%s,s);len=strlen(s);c=count(s);k=0;for(i=1;ilen;i+)t=s0;for(j=1;jlen;i+)t=s0;for(j=1;jc)c=count(s);k=i;printf(在第%d粒珠子前剪开可取走的珠子数最多为%dn,k,c);二#include#includeint count(char*s,int start,int end)int i,c=0,color=sstart,step=(startend)?-1:1;for(i=start;si=color;i+=step)if(step0&iend|step0&iend)break;+c;return c;void main()char t,s100;int i,j,c,len,maxc,cut=0;printf(请输入环上代表不同颜色珠子字符串:);scanf(%s,s);len=strlen(s);for(i=0,maxc=0;ilen;i+)c=count(s,0,len-1);if(cmaxc)cut=i;maxc=c;t=s0;for(j=1;jlen;j+)sj-1=sj;slen-1=t;printf(在第%d号珠子前剪开可取走的珠子数最多为%dn,cut,maxc);三#include#include#includestruct nodechar ch;struct node *fpt;struct node *bpt;node *building(char *s)node *p=NULL,*q;while(*s)q=(node*)malloc(sizeof(node);q-ch=*s+;if(p=NULL)p=q-fpt=q-bpt=q;elsep-bpt-fpt=q;q-fpt=p;q-bpt=p-bpt;p-bpt=q;return p;int count(node *start,int maxn,int step)int color,c;node *p;color=-1;c=0;for(p=start;c0?p-fpt:p-bpt)if(color=-1)color=p-ch;elseif(p-ch!=color)break;c+;return c;int find(char*s,int*cutpos)int i,c,cut,maxc=0,len=strlen(s);node*p;if(p=building(s)=NULL)*cutpos=01;return -1;i=0;doc=count(p,len,1);c=c+count(p-bpt,len-c,-1);if(cmaxc)maxc=c;cut=i;p=p-fpt;i+;while(ilen);*cutpos=cut;return maxc;void main()int cut,max;char s1