fzuoj Problem 2177 ytaaa

Accept: 113 Submit: 265
Time Limit: 2000 mSec Memory Limit : 32768 KB

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <iomanip>
#include <vector>
#pragma comment(linker, "/STACK:1024000000,1024000000")
#pragma warning(disable:4786)

using namespace std;

const int INF = 0x3f3f3f3f;
const int MAX = 1000 + 10;
const double eps = 1e-8;
const double PI = acos(-1.0);

int dp[MAX];
int a[MAX];

int main()
{
int n;
while(~scanf("%d",&n))
{
int i , j;
for(i = 1;i <= n;i ++)
scanf("%d",&a[i]);
memset(dp , 0 , sizeof(dp));
for(i = 1;i <= n;i ++)
for(j = i;j >= 1;j --)
dp[i] = max(dp[i] , dp[j - 1] + (a[i] - a[j]) * (a[i] - a[j]));
printf("%d\n",dp
);
}
return 0;
}