题目链接:http://acm.fzu.edu.cn/problem.php?pid=2302
解题思路:相比较hdu3507点击这里从O(n^2)变成O(n),这里是O(n^4)变成O(n^3).
因为要求了块数所以要变成二维dp,其次又有n种旋转状态,所以就增加了O(n^2),道理和上面链接是一样的,就不多说了。
不懂得戳上面。
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
#define inf 0x3f3f3f3f
using namespace std;
const int mx = 4e2 + 10;
typedef long long ll;
int a[mx],n,m,dp[mx/2][mx/2],sum[mx];
int que[mx],head,tail;
bool better(int x,int y,int j,int k)
{
int a = sum[x]*sum[x]+dp[x][j]-sum[y]*sum[y]-dp[y][j];
int b = 2*sum[k]*(sum[x]-sum[y]);
return a < b;
}
bool small(int x,int y,int z,int j)
{
int a = sum[y]*sum[y]+dp[y][j]-sum[x]*sum[x]-dp[x][j];
a *= (sum[z]-sum[y]);
int b = sum[z]*sum[z]+dp[z][j]-sum[y]*sum[y]-dp[y][j];
b *= (sum[y]-sum[x]);
return a >= b;
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",a+i),a[n+i] = a[i];
int ans = inf;
for(int i=0;i<n;i++){
for(int j=1;j<=n;j++) sum[j] = sum[j-1] + a[j],dp[j][1] = sum[j]*sum[j];
for(int j=2;j<=m;j++){
head = tail = 0;
que[tail++] = j-1;
for(int k=j;k<=n;k++){
while(head+1!=tail&&better(que[head+1],que[head],j-1,k))
head++;
dp[k][j] = (sum[k]-sum[que[head]])*(sum[k]-sum[que[head]])+dp[que[head]][j-1];
while(head+1!=tail&&small(que[tail-2],que[tail-1],k,j-1))
tail--;
que[tail++] = k;
}
}
ans = min(ans,dp[n][m]);
for(int j=1;j<=2*n;j++) a[j] = a[j+1];
}
printf("%d\n",ans);
}
return 0;
}