fzuoj Problem 2177 ytaaa

 1 #include <stdio.h>
 2 #include <algorithm>
 3 #include <iostream>
 4 #include <string.h>
 5 #include <string>
 6 #include <math.h>
 7 #include <stdlib.h>
 8 #include <queue>
 9 #include <stack>
10 #include <set>
11 #include <map>
12 #include <list>
13 #include <iomanip>
14 #include <vector>
15 #pragma comment(linker, "/STACK:1024000000,1024000000")
16 #pragma warning(disable:4786)
17 
18 using namespace std;
19 
20 const int INF = 0x3f3f3f3f;
21 const int MAX = 1000 + 10;
22 const double eps = 1e-8;
23 const double PI = acos(-1.0);
24 
25 int dp[MAX];
26 int a[MAX];
27 
28 int main()
29 {
30     int n;
31     while(~scanf("%d",&n))
32     {
33         int i , j;
34         for(i = 1;i <= n;i ++)
35             scanf("%d",&a[i]);
36         memset(dp , 0 , sizeof(dp));
37         for(i = 1;i <= n;i ++)
38             for(j = i;j >= 1;j --)
39 dp[i] = max(dp[i] , dp[j - 1] + (a[i] - a[j]) * (a[i] - a[j]));
40         printf("%d\n",dp[n]);
41     }
42     return 0;
43 }