noip2010普及

版权声明：https://blog.csdn.net/huashuimu2003 https://blog.csdn.net/huashuimu2003/article/details/86362672

P1199 三国游戏 贪心 || 博弈论

题目

https://www.luogu.org/problemnew/show/P1199

题解

网上好像一堆题解，我就不想赘述了。其实是懒得写题解

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn=505;
inline int read()
{
	int f=1,num=0;
	char ch=getchar();
	while (!isdigit(ch)) { if (ch=='-') f=-1; ch=getchar(); }
	while (isdigit(ch)) num=(num<<1)+(num<<3)+(ch^48), ch=getchar();
	return num*f;
}
int a[maxn][maxn],ans;
int main()
{
	int n=read();
	for (int i=1;i<=n;++i)
	{
		int max1=0,max2=0;
		for (int j=i+1;j<=n;++j)
			a[j][i]=a[i][j]=read();
		for (int j=1;j<=n;++j)
		{
			if (a[i][j]>max1)
				max2=max1,max1=a[i][j];
			else if (a[i][j]>max2)
				max2=a[i][j];
		}
		ans=max(ans,max2);
	}
	printf("1\n%d\n",ans);
	return 0;
}