Hello Joanna

1. 复杂度 O(n^2)#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 30010; int dp[maxn], a[maxn]; int main() { int n; while(scanf("%d",&n)!=EOF) {

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5773Problem Description?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5748Problem DescriptionPeter has a sequence a1,a2,...,an and he define a function on the sequence -- F(a1,a2,...,an)=(f1,f2,...,fn), where fi is the lengt

Link：http://acm.hdu.edu.cn/showproblem.php?pid=1950Problem Description'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwe