1092 最好吃的月饼 （20 分）

我的博客现在正在更新乙级题解哦

我的博客

菜鸡的我又来二刷了 

#include<iostream>
using namespace std;
int base[1010];
int main()
{
	int m, n,j;
	cin >> m >> n;
	for (int i = 1; i <=n; i++)
	{
		for (j = 1; j <=m; j++)
		{
			int k;
			cin >> k;
			base[j] += k;
		}
	}

	int max =base[0];
	for (int i = 1; i <=m; i++)
	{
		if (base[i] >=max)
			max = base[i];
	}
	int k = 0;
	int ans[10010];
	for (int i = 1; i <= m; i++)
	{
		if (base[i] == max)
			ans[k++] = i;
	}
	cout << max<<endl;
	for (int i = 0; i < k; i++)
	{
		cout <<ans[i];
		if (i < k - 1)
			cout << " ";
	}
	return 0;
}

 

感谢-怪物辛吉德的指导，现在测试点全过了

#include<bits/stdc++.h>
using namespace std;
int a[2000][2000];
int main()
{
	vector<int>k;
	int N, M, i, j, i1 = 0;
	cin >> N >> M;
	int b[1000] = { 0 };
	int max = 0;
	for (i = 0; i < M; i++)
	{
		for (j = 0; j < N; j++)
		{
			cin >> a[i][j];
		}
	}
	int sum = 0;
	for (i = 0; i <N; i++)
	{
		for (j = 0; j <M; j++)
		{

			sum += a[j][i];

		}
		k.push_back(sum);
		sum = 0;
	}
	int max2 = k[0];
	for (i = 0; i < k.size(); i++)
	{
		if (k[i] >= max2)
		{
			max2 = k[i];
		}
	}
	cout << max2 << endl;
	for (i = 0; i < N; i++)
	{

		for (j = 0; j < M; j++)
		{
			b[i1] += a[j][i];
		}
		i1++;
	}
	int max1 = b[0];
	for (int i = 0; i < i1; i++)
	{
		if (b[i] >= max1)
		{
			max1 = b[i];
		}
	}
	int c1[100];
	int j1 = 0;
	for (int i = 0; i < i1; i++)
	{
		if (b[i] == max1)
		{
			c1[j1++] = i + 1;
		}
	}
	for (int i = 0; i < j1 - 1; i++)
	{
		cout << c1[i] << ' ';
	}
	cout << c1[j1 - 1];
	return 0;
}

13分,有三个测试点没过,等明天再找

#include<bits/stdc++.h>
using namespace std;
int a[2000][2000];
int main()
{
	
	int N, M,i,j,i1=0;
	cin >> N >> M;
	int b[1000] = { 0 };
	int max = 0;
	for (i = 0; i < M; i++)
	{
		for (j = 0; j <N; j++)
		{
			cin >> a[i][j];
			if (a[i][j] >= max)
				max = a[i][j];
		}
	}
	cout << max << endl;
	for (i = 0; i < N; i++)
	{

		for (j = 0; j < M; j++)
		{
			b[i1] += a[j][i];
		}
		i1++;
	}
	int max1 = b[0];
	for (int i = 0; i < i1; i++)
	{
		if (b[i] >= max1)
		{
			max1 = b[i];
		}
	}
	int c1[100];
	int j1 = 0;
	for (int i = 0; i < i1; i++)
	{
		if (b[i] == max1)
		{
			c1[j1++] = i + 1;
		}
	}
	for (int i = 0; i < j1 - 1; i++)
	{
		cout << c1[i] << ' ';
	}
	cout << c1[j1 - 1];
	system("pause");
	return 0;
}

两个测试点错了

#include<bits/stdc++.h>
using namespace std;
int a[2000][2000];
int main()
{
	vector<int>k;
	int N, M, i, j, i1 = 0;
	cin >> N >> M;
	int b[1000] = { 0 };
	int max = 0;
	for (i = 0; i < M; i++)
	{
		for (j = 0; j < N; j++)
		{
			cin >> a[i][j];
		}
	}
	int sum = 0;
	for (i = 0; i < M; i++)
	{
		for (j = 0; j < N; j++)
		{
			
			sum+= a[j][i];
			
		}
		k.push_back(sum);
		sum = 0;
	}
	int max2 = k[0];
	for (i = 0; i < k.size(); i++)
	{
		if (k[i] >= max2)
		{
			max2 = k[i];
		}
	}
	cout << max2 << endl;
	for (i = 0; i < N; i++)
	{

		for (j = 0; j < M; j++)
		{
			b[i1] += a[j][i];
		}
		i1++;
	}
	int max1 = b[0];
	for (int i = 0; i < i1; i++)
	{
		if (b[i] >= max1)
		{
			max1 = b[i];
		}
	}
	int c1[100];
	int j1 = 0;
	for (int i = 0; i < i1; i++)
	{
		if (b[i] == max1)
		{
			c1[j1++] = i + 1;
		}
	}
	for (int i = 0; i < j1 - 1; i++)
	{
		cout << c1[i] << ' ';
	}
	cout << c1[j1 - 1];
	return 0;
}