UVA 1625 Color Length - ACM/ICPC Daejeon 2011
2018-03-30 09:51
387 查看
#include<bits/stdc++.h> using namespace std; int i,j,v1,v2,l1,l2,cas; int sq[26],sp[26],eq[26],ep[26]; int d[5010][5010],c[5010][5010]; char q[5010],p[5010]; int main(){ scanf("%d",&cas); while(cas--){ scanf("\n%s\n%s",q+1,p+1); l1=strlen(q+1); l2=strlen(p+1); for(i=1;i<=l1;i++) q[i]-='A'; for(i=1;i<=l2;i++) p[i]-='A'; memset(sq,0x3f,sizeof(sq)); memset(sp,0x3f,sizeof(sp)); memset(eq,-1,sizeof(eq)); memset(ep,-1,sizeof(ep)); for(i=1;i<=l1;i++){ sq[q[i]]=min(sq[q[i]],i); eq[q[i]]=i; } for(i=1;i<=l2;i++){ sp[p[i]]=min(sp[p[i]],i); ep[p[i]]=i; } for(i=0;i<=l1;i++) for(j=0;j<=l2;j++){ if(i==0&&j==0)continue; v1=0x3f3f3f3f; v2=0x3f3f3f3f; if(i)v1=d[i-1][j]+c[i-1][j]; if(j)v2=d[i][j-1]+c[i][j-1]; d[i][j]=min(v1,v2); if(i){ c[i][j]=c[i-1][j]; if(sq[q[i]]==i&&sp[q[i]]>j)c[i][j]++; if(eq[q[i]]==i&&ep[q[i]]<=j)c[i][j]--; } else if(j){ c[i][j]=c[i][j-1]; if(sp[p[j]]==j&&sq[p[j]]>i)c[i][j]++; if(ep[p[j]]==j&&eq[p[j]]<=i)c[i][j]--; } } printf("%d\n",d[l1][l2]); } return 0; }
相关文章推荐
- UVA 1625—Color Length(ACM/ACPC Daejeon 2011)
- 【组合数学】Pole Arrangement, ACM/ICPC Daejeon 2012, UVa1638
- UVa1625 Color Length
- UVALive 7061 Dire Wolf (dp)(The 2014 ACM-ICPC Asia Beijing Regional Contest D)
- UVA1625 - Color Length (DP)
- UVA 1625 Color Length
- Uva1625 Color Length
- 例题7-13 快速幂计算(Power Calculus, ACM/ICPC Yokohama 2006, UVa1374)
- 习题7-1 消防车(Firetruck, ACM/ICPC World Finals 1991, UVa208)
- UVa816 例题 6-14 Abbott的复仇 (Abbott's Revenge,ACM/ICPC World Finals 2000)
- UVA1625 Color Length(附 刘汝佳代码)
- UVA 1252 Twenty Questions - ACM/ICPC Tokyo 2009
- 【数论】Irrelevant Elements, ACM/ICPC NEERC 2004, UVa1635 【组合数学】
- 弱键(Weak Key, ACM/ICPC Seoul 2004, UVa1618)
- UVa1605 例题8-2 联合国大楼(Building for UN,ACM/ICPC NEERC 2007)
- UVa210 Concurrency Simulator (ACM/ICPC World Finals 1991) 双端队列
- UVA - 1625 Color Length[序列DP 提前计算代价]
- Score,ACM/ICPC Seoul 2005,UVa1585
- 「备战PKUWC2018」2017-2018 ACM-ICPC, Asia Daejeon Regional Contest
- Hdu 4089 Activation (概率dp) - 2011 ACM-ICPC Beijing Regional Contest Problem I