HZAU1098: Yifan and War3(区间dp)
2016-12-20 10:58
232 查看
1098: Yifan and War3
Time Limit: 3 Sec Memory Limit:128 MB
Submit: 622 Solved: 20
[Submit][Status][Web
Board]
Description
As we all know, There is a hero called Priestess of the Moon(POM), which has apassive abilitynamed Trueshot Aura . It can add
other units some ranged attacks . Fanfan love the Human very much, and he will battle with a Night Elf everyday , because he thinks the Night Elf can’t attack his tower easily .But today , he met a Night Elf player , who use POM as his first hero, and had
lots of Archers . Fanfan use theMountain King to kill the Archers ,and don’t know how many health he need to kill all the Archers .Could you help him ?
To make the problem simple , we assume that all the Archers stand in a line , they have different attacks , if Fanfan kills the ith Archer , the (i+1)th and the (i-1)th Archer will help
to attack Fanan by their own attacks . There are N Archers , and Fanfan wants to know the least damage he will get to kill all the Archers .
Input
First line contains an integer N (0<N<200), means there are N Archers .Then the next line contains N integers ai(0<ai<100000) means that the ith Archers have ai attacks .
Output
An integer means the least damage Fanfan will get.Sample Input
3 10 100 10
Sample Output
150
HINT
Yifan first kill the second Archer , get 100+10+10 demages , and then kill the first one ,get 10+10 demages and finally kill the third one and get 10 demages so , he get 150 demage看了其他人的思路整理出来。相似题目:POJ1651:Multiplication Puzzle
# include <stdio.h> # include <string.h> int min(int a, int b) { return a<b?a:b; } int main() { int dp[202][202] = {0}, a[202], i, n, k, len, imin, imin1, imin2; while(scanf("%d",&n) != EOF) { memset(a, 0, sizeof(a)); memset(dp, 0, sizeof(dp)); for(i=1; i<=n; ++i) scanf("%d",&a[i]); a[0] = a[n+1] = 0; for(i=1; i<=n; ++i) dp[i][i] = a[i-1]+a[i]+a[i+1]; for(len=1; len<=n; ++len) { for(i=1; i+len<=n; ++i) { //相当于枚举最后消去的点 imin1 = dp[i+1][i+len]+a[i-1]+a[i+len+1]+a[i]; //为第一个点的情况 imin2 = dp[i][i+len-1] + a[i+len]+a[i-1]+a[i+len+1];//为最后一个点的情况 imin = min(imin1, imin2); for(k=i+1; k<i+len; ++k)//为点在中间的情况 imin = min(imin, dp[i][k-1]+dp[k+1][i+len]+a[k]+a[i-1]+a[i+len+1]); dp[i][i+len] = imin; } } printf("%d\n",dp[1] ); } return 0; }
相关文章推荐
- HDOJ 5115 Dire Wolf /HZAUOJ 1098 Yifan and War3 (裸区间dp)
- 华中农大HZAUOJ 1098 Yifan and War3 区间dp
- hdu-5900 QSC and Master(区间dp)
- Zuma HDU - 6212 (区间dp)
- Codeforces 149D Coloring Brackets 【区间dp】
- 2016 ACM/ICPC Asia Regional Shenyang Online 1009/HDU 5900 区间dp
- POJ 2955 Brackets 括号匹配 区间DP
- poj1651 区间dp
- NYOJ 737 石子合并(一) (区间DP+平行四边形优化)
- 基础DP,数列中取k个区间,使和最大
- hdu2017青岛网络赛Zuma(区间dp)
- hdu3280Equal Sum Partitions (区间DP)
- hdoj-5115 14年ICPC北京站D题 Dire Wolf 区间dp
- 区间dp
- hihoCoder 1110 正则表达式 (区间dp)
- poj1651Multiplication Puzzle(取数,区间DP)
- 【堆+区间DP】Orz细菌(orz)
- HDU 4283 You Are the One(区间dp)
- 2015 UESTC Training for Dynamic Programming 男神的礼物(区间dp)
- 区间DP:Brackets