2014
02-14

# Cai In

Hero Goblin Techies in DOTA have two skills: Remote Mines – Plants a powerful mine that only detonates when triggered and Detonate – Detonates all remote mines at the same time.
A mine with power A will demage enemy r away from it 1000 * A / (r * r). And when all mines detonate at the same time, the demage to an enemy is the maximum of all the mines, that is maximus of 1000 * A[i] / (r[i] * r[i]).

Goblin Techies has plant many mines in the map, and Panda want to pass the dangerous region.
The region is square, with each side of length 100.0. The coordinate of the southwest corner is (x = 0, y = 0) and the coordinate of the northeast corner is (x = 100, y = 100).
The Panda will enter at (50, 0) and exit at (50, 100), and won’t go out of the region in any other way.

Given the coordinates and powers of all mines in the region, what shound the Panda’s HP be at least if Panda want to pass the region before he died? Assume Panda will choose the best path.

Each case have four lines. The first line are n integers x[i], the second line are n integers y[i], the third line are n integers A[i], the last line is an empty line. 1 <= n <= 55.

Each case have four lines. The first line are n integers x[i], the second line are n integers y[i], the third line are n integers A[i], the last line is an empty line. 1 <= n <= 55.

50
2
87

20 50 70
50 70 80
42 42 42

10 10 10 20 30 40 50 60 40 50 60 70 80 80 80 90 90 90
40 50 60 60 60 60 60 70 30 30 30 30 40 30 20 50 40 10
90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90

21750.000
105.000
400.000

1. 煎蛋无聊图的核心内容是无聊图，没有人发有趣的图片人气就下来了，dian chi 哥作为无聊图的主力，却被一群素质极低、出口就是脏话的人咬着喷，实在是有点莫名其妙。

2. if(j){
int ans=a ;
for(int x=j-1;x>=0;x–){
if(!a ) break;
ans=min(ans,a );
sum+=ans;
}
}
求解释，，dp的思路是什么呢？

3. 有一点问题。。后面动态规划的程序中
int dp[n+1][W+1];
会报错 提示表达式必须含有常量值。该怎么修改呢。。