SRM 233 Div II Level Two: PipeCuts

最新推荐文章于 2019-10-21 17:23:06 发布

xuzhezhaozhao

最新推荐文章于 2019-10-21 17:23:06 发布

阅读量1k

点赞数 2

分类专栏： TopCoder

本文链接：https://blog.csdn.net/xzz_hust/article/details/9366759

版权

TopCoder 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

题目来源: http://community.topcoder.com/stat?c=problem_statement&pm=3994

比较简单, 搜索全部情况!

代码如下:

#include <algorithm>
#include <string>
#include <vector>


using namespace std;

/************** Program  Begin *********************/

class PipeCuts {
public:
    double probability(vector <int> weldLocations, int L) {
	double res;
	int all = 0;
	int good = 0;
	int front, below;
	for (int i = 0; i < weldLocations.size() - 1; i++) {
		for (int j = i + 1; j < weldLocations.size(); j++) {
			++all;
			front = max(weldLocations[i], weldLocations[j]);
			below = min(weldLocations[i], weldLocations[j]);

			if (	front - below > L ||
				below > L ||
				100 - front > L) {
				++good;
			}
		}
	}

	res = (double) good / all;

	return res;
    }

};

/************** Program End ************************/