2020 牛客多校第六场 C-Combination of Physics and Maths（思维）

最新推荐文章于 2020-09-28 18:00:28 发布

_Daredevil_

最新推荐文章于 2020-09-28 18:00:28 发布

阅读量293

点赞数

分类专栏：训练赛病历引理 & 技巧 & NT 文章标签： c++ 算法

本文链接：https://blog.csdn.net/Carizy/article/details/108541352

版权

训练赛病历同时被 2 个专栏收录

25 篇文章 1 订阅

订阅专栏

引理 & 技巧 & NT

9 篇文章 0 订阅

订阅专栏

题目链接: C-Combination of Physics and Maths

Description

题意：给出一个二维矩阵，求最大压力，压力为子矩阵之和除子矩阵底层元素之和

在这里插入图片描述

Input

There are multiple test cases. The first line of input contains an integer T（T <= 100）.
indicating the number of test cases. For each test case:
The first line contains two integers n, m(1 <= n, m <= 200) the number of rows and columns of the matrix, respectively.
Each of the next nn lines contains mm integers, specifying the matrix (1 <= a_i,j<= 5e4).

Output

For each test case, print the maximum pressure within an absolute or relative error of no more than 10⁸ in one line.

Sample Input

1
3 3
1 3 5
6 8 9
2 7 4

Sample Output

4.50000000

Method

利用性质设列矩阵A, B，必有压_A <= 压_A+B <= 压_B 或压_B <= 压_A+B <= 压_A;
所以其实就转换成求压力最大的列矩阵的压力值，O(m*n) 遍历矩阵即可；

Code

详见注释

#include <bits/stdc++.h>

using namespace std;
#pragma GCC optimize(2)
#define ios std::ios::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define rtxt freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define ll long long
const int Max = 1e3+3;
const int mod = 1e9+7;

int a[Max][Max], n, m, tmp, T;
double ans=0;

int main()
{
	ios
	
	cin >> T;
	while(T--)
	{
		cin >> n >> m;
		for(int i=1; i<=n; i++)
			for(int j=1; j<=m; j++)
				cin >> a[i][j];
		for(int i=1; i<=m; i++)							//遍历矩阵
		{
			tmp = 0;
			for(int j=1; j<=n; j++)
			{
				tmp += a[j][i];
				ans = max(ans, (double)tmp/a[j][i]);	//求最大值
			}
		}
		printf("%.8lf\n", ans);
		ans = 0;
	}
	return 0;
}