摘要:
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2080最长公共子序列状态方程if (ci==cj)dp[i][j] = dp[i-1][j-1]+1;elsedp[i][j] = max{dp[i-1][j],dp[i][j-1]};View Code 1 #include <iostream> 2 #include<cstdio> 3 #include<string.h> 4 using namespace std; 5 int main() 6 { 7 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1215打表 从小到N/2 筛能把自己整除的数#include <iostream>#include<cstdio>#include<string.h>#define N 500001using namespace std;__int64 s[N+10];int main(){ int i,j,k,n,m; for(i = 1 ; i <= N/2 ; i++) { for(j=i+i ; j< N ; j+=i) s[j]+=i; } scanf("% 阅读全文