Codeforces Round #358D. Alyona and Strings【DP】
来源:互联网 发布:努尔哈赤知乎 编辑:程序博客网 时间:2024/06/07 00:02
#include<bits/stdc++.h>using namespace std;char a[1024],b[1024];int dp[1024][1024][20],ans[1024][1024][20];int main(){ int n,m,p; scanf("%d%d%d",&n,&m,&p); scanf("%s",a+1); scanf("%s",b+1); memset(dp,0,sizeof(dp)); memset(ans,0,sizeof(ans)); for(int k=1;k<=p;k++) { for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { if(a[i]==b[j]) { dp[i][j][k]=max(dp[i-1][j-1][k]+1,ans[i-1][j-1][k-1]+1); } else dp[i][j][k]=0; ans[i][j][k]=max(ans[i-1][j][k],ans[i][j-1][k]); ans[i][j][k]=max(ans[i][j][k],dp[i][j][k]); } } } printf("%d\n",ans[n][m][p]); return 0;}
0 0
- Codeforces Round #358D. Alyona and Strings【DP】
- Codeforces Round #358 (Div. 2) D. Alyona and Strings dp
- Codeforces Round #358 (Div. 2) D. Alyona and Strings dp
- Codeforces Round #358 (Div. 2) D. Alyona and Strings(字符串dp)
- Codeforces Round #358 (Div. 2) D Alyona and Strings(DP)
- Codeforces Round #358 (Div. 2) -- D. Alyona and Strings (DP)
- Codeforces Round #358 (Div. 2) D. Alyona and Strings(DP)
- Codeforces Round #358 (Div. 2) D. Alyona and Strings (DP)
- Codeforces Round #358 (Div. 2) D. Alyona and Strings
- Codeforces Round #358 (Div. 2)D. Alyona and Strings
- Codeforces Round #358 (Div. 2) D. Alyona and Strings
- Codeforces Round #358 (Div. 2) D. Alyona and Strings
- Codeforces Round #358 (Div. 2) D. Alyona and Strings
- Codeforces 682D Alyona and Strings【dp】
- Codeforces 682D Alyona and Strings DP
- codeforces 358D. Alyona and Strings (dp)
- Codeforces - 358D - Alyona and Strings(dp)
- Codeforces Round #358 (Div. 2) Alyona and Strings
- css的全局样式
- 详解rsyslog/Python/LogAnalyzer 记录和查看服务端/客户端日志
- Eclipse常用快捷键
- Java Web知识结构
- tensorflow读取数据之CSV格式
- Codeforces Round #358D. Alyona and Strings【DP】
- linux系统redis服务配置
- TC的handler类调用swt窗口
- OZ工具安装使用
- pojlainxi
- 态度
- NFC数据串口传输模块(NFC2COM)--风火轮
- Ajax异步请求
- tomcat启动不了报错: Publishing failed Could not publish to the server. java.lang.IndexOutOfBoundsException