首页 > ACM题库 > HDU-杭电 > HDU 1155 Bungee Jumping[解题报告] C++
2013
12-03

HDU 1155 Bungee Jumping[解题报告] C++

Bungee Jumping

问题描述 :

Once again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby highway bridge which he can use to escape from his enemies. His plan is to attach one end of the rope to the bridge, the other end of the rope to his body and jump off the bridge. At the moment he reaches the ground, he will cut the rope, jump into his car and be gone.

Unfortunately, he had not had enough time to calculate whether the bungee rope has the right length, so it is not clear at all what is going to happen when he jumps off the bridge. There are three possible scenarios:
The rope is too short (or too strong), and James Bond will never reach the ground.
The rope is too long (or too weak), and James Bond will be going too fast when he touches the ground. Even for a special agent, this can be very dangerous. You may assume that if he collides at a speed of more than 10 m/s, he will not survive the impact.
The rope’s length and strength are good. James Bond touches the ground at a comfortable speed and can escape.
As his employer, you would like to know whether James Bond survives or whether you should place a job ad for the soon-to-be vacant position in the local newspaper. Your physicists claim that:
The force with which James is pulled towards the earth is
9.81 * w,
where w is his weight in kilograms and 9.81 is the Earth acceleration in meters over squared seconds.
Mr. Bond falls freely until the rope tautens. Then the force with which the bungee rope pulls him back into the sky depends on the current length of the rope and is
k * Δl,
where Δl is the difference between the rope’s current length and its nominal, unexpanded length, and k is a rope-specific constant.
Given the rope’s strength k, the nominal length of the rope l in meters, the height of the bridge s in meters, and James Bond’s body weight w, you have to determine what is going to happen to our hero. For all your calculations, you may assume that James Bond is a point at the end of the rope and the rope has no mass. You may further assume that k, l, s, and w are non-negative and that s < 200.

The input contains several test cases, one test case per line. Each test case consists of four floating-point numbers (k, l, s, and w) that describe the situation. Depending on what is going to happen, your program must print "Stuck in the air.", "Killed by the impact.", or "James Bond survives.". Input is terminated by a line containing four 0s, this line should not be processed.

样例输入:

350 20 30 75
375 20 30 75
400 20 30 75
425 20 30 75
450 20 30 75
400 20 30 50
400 20 30 80
400 20 30 85
0 0 0 0

样例输出:

Killed by the impact.
James Bond survives. 
James Bond survives. 
James Bond survives. 
Stuck in the air.
Stuck in the air.
James Bond survives. 
Killed by the impact.

点击打开链接

分析:

当绳长大于桥高时,判断10m/s的动能与重力势能的大小,前者大于等于后者,摔死。。否则安全

当绳长小于等于桥高时,当弹性势能大于重力势能,飞上天。否则判断重力势能和弹性势能的差值与10m/s的动能的大小关系,当前者大于后者,摔死,否则安全。。

#include"stdio.h"
#include"string.h"
#define g 9.81
int main()
{
	double k,s,l,w;
	double e1,e2,e3;
	while(scanf("%lf%lf%lf%lf",&k,&l,&s,&w)!=-1)
	{
		if(!k&&!l&&!s&&!w)break;
		e1=0.5*w*100;//10m/s的动能
		e2=w*s*g;//重力势能
		e3=0.5*k*(s-l)*(s-l);//弹性势能
		if(l>s)//绳长大于桥高
		{
			if(e2>e1)printf("Killed by the impact.\n");
			else printf("James Bond survives.\n");
		}
		else
		{
			if(e2<e3)printf("Stuck in the air.\n");
			else if(e2-e3>e1)printf("Killed by the impact.\n");
			else printf("James Bond survives.\n");
		}
	}
	return 0;
}


  1. for(int i=1; i<=m; i++){
    for(int j=1; j<=n; j++){
    dp = dp [j-1] + 1;
    if(s1.charAt(i-1) == s3.charAt(i+j-1))
    dp = dp[i-1] + 1;
    if(s2.charAt(j-1) == s3.charAt(i+j-1))
    dp = Math.max(dp [j - 1] + 1, dp );
    }
    }
    这里的代码似乎有点问题? dp(i)(j) = dp(i)(j-1) + 1;这个例子System.out.println(ils.isInterleave("aa","dbbca", "aadbbcb"));返回的应该是false

  2. “可以发现,树将是满二叉树,”这句话不对吧,构造的树应该是“完全二叉树”,而非“满二叉树”。

  3. 5.1处,反了;“上一个操作符的优先级比操作符ch的优先级大,或栈是空的就入栈。”如代码所述,应为“上一个操作符的优先级比操作符ch的优先级小,或栈是空的就入栈。”