【DP】 POJ 1160 Post Office
2014-11-11 19:55
387 查看
很经典的题。。。具体可以看毛子青大神的论文。。。。
#include <iostream> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cstdio> #include <algorithm> #include <cstring> #include <climits> #include <cstdlib> #include <cmath> #include <time.h> #define maxn 305 #define maxm 1000005 #define eps 1e-10 #define mod 1000000007 #define INF 0x3f3f3f3f #define PI (acos(-1.0)) #define lowbit(x) (x&(-x)) #define mp make_pair #define ls o<<1 #define rs o<<1 | 1 #define lson o<<1, L, mid #define rson o<<1 | 1, mid+1, R #pragma comment(linker, "/STACK:16777216") typedef long long LL; typedef unsigned long long ULL; //typedef int LL; using namespace std; LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;} LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;} void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();} LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);} // head int a[maxn]; int s[maxn][maxn]; int sum[maxn]; int w[maxn][maxn]; int dp[maxn][maxn]; int n, m; void init(void) { memset(w, 0, sizeof w); memset(dp, INF, sizeof dp); } void read(void) { for(int i = 1; i <= n; i++) scanf("%d", &a[i]); } void work(void) { for(int i = 1; i <= n; i++) sum[i] = sum[i-1] + a[i]; for(int i = 1; i <= n; i++) for(int j = i; j <= n; j++) { int mid = (i + j) >> 1; w[i][j] = (sum[j] - sum[mid]) - (j - mid) * a[mid] + a[mid] * (mid - i + 1) - (sum[mid] - sum[i-1]); } for(int i = 1; i <= n; i++) dp[1][i] = w[1][i]; for(int i = 1; i <= m; i++) s[i][n+1] = n; for(int i = 2; i <= m; i++) for(int j = n; j >= 1; j--) for(int k = s[i-1][j]; k <= s[i][j+1]; k++) if(dp[i][j] > dp[i-1][k] + w[k+1][j]) { dp[i][j] = dp[i-1][k] + w[k+1][j]; s[i][j] = k; } printf("%d\n", dp[m] ); } int main(void) { while(scanf("%d%d", &n, &m)!=EOF) { init(); read(); work(); } return 0; }
相关文章推荐
- POJ1160 Post Office(经典DP)
- POJ 1160 Post Office(抽象的二维DP)
- poj 1160 Post Office(dp)
- POJ 1160 Post Office 四边形不等式优化DP
- poj 1160 Post Office(经典dp)
- poj - 1160 - Post Office(dp)
- poj 1160 Post Office(DP简单题)
- POJ 1160 Post Office(dp)
- POJ 1160 Post Office (区间DP+重心)
- POJ 1160 Post Office (四边形不等式优化DP)
- POJ 1160 Post Office(DP)
- 【DP|数学+预处理】POJ-1160 Post Office
- POJ-1160 Post office 四边形优化DP
- POJ1160 Post Office (四边形不等式优化DP)
- poj 1160 Post Office & SCAU 07校赛10320 Post Office ( dp )
- poj 1160 Post Office (区间DP)
- poj 1160 post office------DP
- poj 1160 Post Office(DP-简单DP)
- POJ 1160 Post Office (水DP)
- POJ 1160 Post Office(dp)