The Problem 1
Recycling glass requires that the glass be separated by colour into one of three categoried:brown glass ,green glass and clear glass.In this problem,you will be given 3 recycling bins ,each containing aspecified number of brown,green and clear bottles.In order to be recycled,the bottle will need to be moved so that each bin contains bottles od any one colour.That problem is to minimize the number of bottles that are moved.You may assume that the only problem is to minimize the number of movements between boxes.For the purposes of this problem,each bin has infinite capacity and the only constraint is moving the bottles so that each bin contains bottles of a single colour.The total number of bottles will never exceed 2^31.
The Problem 2
Given a sequence of streets(connecting given intersections)you are to write a program that determines the minimal cost tour that traver every street at least once.The tour must begin and end at the same intersections.The 'real-life' analogy concerns a postal worker who parks a truck at an intersection then walks and streets on the postal delivery route (delivering mail) and return to the truct to continue with the next route.
The cost of traversing a street is a function of the length of the street (There is a cost associated with delivering mail to houses and with walking even if no delivering occurs ).
In this problem the number of streets that meet at a given intersection is called the degree of the intersection.There will be at most two inersections with odd degree.All other inetersection will have even degree.i.e an even number of streets meeting at that intersection.邮递员问题
The Problem 3
It is always very nice to have little brothers or sisters.You can tease them,lock them in the bathroom or put red hot chili in their sandwiches.But there is also a time when all meanness comes back!
as you know ,in one month it is Christmas and this year you are honored to make the big star that will be stack
on the top of the Christmas tree.But when you get the triangle-patterned silver paper you realize that there aremany holds in it .Your little sister has already cut out smaller triangles for thr normalChristmasstars.
You only chance is to find an algorithm that tells you for each piece of silver paper the size of the largst
remaining triangle.
Given a triangle strneture with white and black fields inside you must find the largest triangle area of white fields ,as shown in the following figure.请给出全部代码谢谢.
Recycling glass requires that the glass be separated by colour into one of three categoried:brown glass ,green glass and clear glass.In this problem,you will be given 3 recycling bins ,each containing aspecified number of brown,green and clear bottles.In order to be recycled,the bottle will need to be moved so that each bin contains bottles od any one colour.That problem is to minimize the number of bottles that are moved.You may assume that the only problem is to minimize the number of movements between boxes.For the purposes of this problem,each bin has infinite capacity and the only constraint is moving the bottles so that each bin contains bottles of a single colour.The total number of bottles will never exceed 2^31.
The Problem 2
Given a sequence of streets(connecting given intersections)you are to write a program that determines the minimal cost tour that traver every street at least once.The tour must begin and end at the same intersections.The 'real-life' analogy concerns a postal worker who parks a truck at an intersection then walks and streets on the postal delivery route (delivering mail) and return to the truct to continue with the next route.
The cost of traversing a street is a function of the length of the street (There is a cost associated with delivering mail to houses and with walking even if no delivering occurs ).
In this problem the number of streets that meet at a given intersection is called the degree of the intersection.There will be at most two inersections with odd degree.All other inetersection will have even degree.i.e an even number of streets meeting at that intersection.邮递员问题
The Problem 3
It is always very nice to have little brothers or sisters.You can tease them,lock them in the bathroom or put red hot chili in their sandwiches.But there is also a time when all meanness comes back!
as you know ,in one month it is Christmas and this year you are honored to make the big star that will be stack
on the top of the Christmas tree.But when you get the triangle-patterned silver paper you realize that there aremany holds in it .Your little sister has already cut out smaller triangles for thr normalChristmasstars.
You only chance is to find an algorithm that tells you for each piece of silver paper the size of the largst
remaining triangle.
Given a triangle strneture with white and black fields inside you must find the largest triangle area of white fields ,as shown in the following figure.请给出全部代码谢谢.
解决方案 »
免费领取超大流量手机卡，每月29元包185G流量+100分钟通话, 中国电信官方发货