算法分析习题课一章.pptx

算法分析习题选讲(第一章);第一章;1020BigInteger;解题思路;解题思路;1021Couple;解题思路;例子1;例子2;代码;1027MJ,NowheretoHide;解题思路;1035DNAmatching;解题思路;1046PlaneSpotting;解题思路;for(i=0;in;i++){

temp=0;

for(j=i+1;jn;j++){

temp+=a[j];

if(j-i+1=k){

p[cnt].length=j-i+1;

p[cnt].ends=j+1;

p[cnt].aver=(double)temp/(j-i+1);

cnt++;

}

}

}

sort(p,p+cnt);

;1051BikersTripOdomete;解题思路;1198Substring;解题思路;sort(sub,sub+n);

do{

stringtotal=“”;

for(i=0;in;++i)

total+=sub[i];

ans=min(ans,total);

}while(next_permutation(sub,sub+n));;1176TwoEnds;解题思路;intcal(intleft,intright){

if(rightleft) return0;

if(is_cal[left][right]) returnans[left][right];

intans_left=arr[left];

if(arr[left+1]arr[right])ans_left+=cal(left+1,right-1);

else ans_left+=cal(left+2,right);

intans_right=arr[right];

if(arr[left]arr[right-1])ans_right+=cal(left,right-2);

else ans_right+=cal(left+1,right-1);

is_cal[left][right]=true;

returnans[left][right]=max(ans_left,ans_right);

}

;动态规划;for(i=0;in;i++)f[i][i]=-data[i];

for(i=n-1;i=0;i--)

for(j=i+1;jn;j++)

if((j-i+1)%2)

if(data[i]=data[j])

f[i][j]=-data[i]+f[i+1][j];

else

f[i][j]=-data[j]+f[i][j-1];

else

f[i][j]=max(data[i]+f[i+1][j],data[j]+f[i][j-1]); ;谢谢！