1.不要动态申请内存
2.去洛谷在线IDE上跑数据
by Hades18 @ 2017-11-09 19:37:49
yyk is so strong
by 蹲在丛中笑 @ 2017-11-09 19:49:58
简直绝望#include<cstdio>
```cpp
#include<iostream>
char s[100010], t[100010];
int dp[10001][10001];
int main() {
int n;
scanf("%d", &n);
for(int i=0; i<n; i++) scanf("%d", &s[i]);
for(int i=0; i<n; i++) scanf("%d", &t[i]);
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
if(s[i]==t[j]) dp[i+1][j+1]=dp[i][j]+1;
else dp[i+1][j+1]=std::max(dp[i][j+1], dp[i+1][j]);
printf("%d", dp[n][n]);
return 0;
}
```
by char32_t @ 2017-11-21 14:11:54
五彩斑斓
#1
AC
0ms/2140KB
#2
RE
#3
AC
0ms/2234KB
#4
AC
0ms/2976KB
#5
WA
#6
WA
#7
MLE
#8
RE
#9
RE
#10
RE
by char32_t @ 2017-11-21 14:14:42
您的空间是n^2的，还能不RE
by cosmicAC @ 2018-08-27 20:07:00
考古
by k1saki @ 2019-09-28 15:18:49