标签：scan cat 最小 prope example ica 三角形 printf ret
There are nn points on the plane, (x1,y1),(x2,y2),…,(xn,yn)(x1,y1),(x2,y2),…,(xn,yn).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the triangle). Calculate the minimum length of the shorter side of the triangle.
First line contains one integer nn (1≤n≤1051≤n≤105).
Each of the next nn lines contains two integers xixi and yiyi (1≤xi,yi≤1091≤xi,yi≤109).
Print the minimum length of the shorter side of the triangle. It can be proved that it‘s always an integer.
3
1 1
1 2
2 1
3
4
1 1
1 2
2 1
2 2
4
Illustration for the first example:
Illustration for the second example:
题意：唔就是，让你找到一个最小的等腰三角形，使得给出的所有点都包含在等腰三角形里或者等腰三角形边上
分析: 其实就是找给出的点在y轴上截距最大的时候，满足方程y=-x+b,移一下就是,x+y=b，只要找到x+y的最大值即可、
1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 #include<cmath> 5 using namespace std; 6 int main() 7 { 8 int n; 9 while(~scanf("%d",&n)) 10 { 11 int a,b,ans=0; 12 while(n--) 13 { 14 scanf("%d %d",&a,&b); 15 ans=max(a+b,ans); 16 } 17 printf("%d\n",ans); 18 } 19 return 0; 20 }
标签：scan cat 最小 prope example ica 三角形 printf ret
原文地址：https://www.cnblogs.com/LLLAIH/p/9736436.html
