CodeForces
来源:互联网 发布:奚梦瑶 台步 知乎 编辑:程序博客网 时间:2024/06/03 16:59
题目链接:http://codeforces.com/problemset/problem/733/D点击打开链接
Kostya is a genial sculptor, he has an idea: to carve a marble sculpture in the shape of a sphere. Kostya has a friend Zahar who works at a career. Zahar knows about Kostya's idea and wants to present him a rectangular parallelepiped of marble from which he can carve the sphere.
Zahar has n stones which are rectangular parallelepipeds. The edges sizes of the i-th of them are ai, bi and ci. He can take no more than two stones and present them to Kostya.
If Zahar takes two stones, he should glue them together on one of the faces in order to get a new piece of rectangular parallelepiped of marble. Thus, it is possible to glue a pair of stones together if and only if two faces on which they are glued together match as rectangles. In such gluing it is allowed to rotate and flip the stones in any way.
Help Zahar choose such a present so that Kostya can carve a sphere of the maximum possible volume and present it to Zahar.
The first line contains the integer n (1 ≤ n ≤ 105).
n lines follow, in the i-th of which there are three integers ai, bi and ci (1 ≤ ai, bi, ci ≤ 109) — the lengths of edges of the i-th stone. Note, that two stones may have exactly the same sizes, but they still will be considered two different stones.
In the first line print k (1 ≤ k ≤ 2) the number of stones which Zahar has chosen. In the second line print k distinct integers from 1 to n — the numbers of stones which Zahar needs to choose. Consider that stones are numbered from 1 to n in the order as they are given in the input data.
You can print the stones in arbitrary order. If there are several answers print any of them.
65 5 53 2 41 4 12 1 33 2 43 3 4
11
710 7 85 10 34 2 65 5 510 2 84 2 17 7 7
21 5
In the first example we can connect the pairs of stones:
- 2 and 4, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
- 2 and 5, the size of the parallelepiped: 3 × 2 × 8 or 6 × 2 × 4 or 3 × 4 × 4, the radius of the inscribed sphere 1, or 1, or 1.5respectively.
- 2 and 6, the size of the parallelepiped: 3 × 5 × 4, the radius of the inscribed sphere 1.5
- 4 and 5, the size of the parallelepiped: 3 × 2 × 5, the radius of the inscribed sphere 1
- 5 and 6, the size of the parallelepiped: 3 × 4 × 5, the radius of the inscribed sphere 1.5
Or take only one stone:
- 1 the size of the parallelepiped: 5 × 5 × 5, the radius of the inscribed sphere 2.5
- 2 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
- 3 the size of the parallelepiped: 1 × 4 × 1, the radius of the inscribed sphere 0.5
- 4 the size of the parallelepiped: 2 × 1 × 3, the radius of the inscribed sphere 0.5
- 5 the size of the parallelepiped: 3 × 2 × 4, the radius of the inscribed sphere 1
- 6 the size of the parallelepiped: 3 × 3 × 4, the radius of the inscribed sphere 1.5
It is most profitable to take only the first stone.
其实就是找两个长方体拼起来之后的最短长度能有多长
分析一下可以知道 只能让最短和次短的那个面拼
拼完还得分析一下这两个哪个短
前面排个序就行
#include <iostream>#include <queue>#include <stdio.h>#include <stdlib.h>#include <stack>#include <limits.h>#include <string>#include <string.h>#include <vector>#include <set>#include <map>#include <algorithm>#include <math.h>using namespace std;#define maxn 100010struct xjy{ int x,y,z; int num ; bool operator < (const xjy &r) const { if(x==r.x) { if(y==r.y) return z>r.z; return y>r.y; } return x>r.x; }};vector< xjy > s;int main(){ int n; cin >> n; int ans=-1; int ansnum[2]; int cnt=1; for(int i=1;i<=n;i++) { int mid[3]; xjy midmid; cin >> mid[0] >> mid[1] >> mid[2]; sort(mid,mid+3); midmid.x=mid[2]; midmid.y=mid[1]; midmid.z=mid[0]; midmid.num=i; s.push_back(midmid); if(ans<midmid.z) { ansnum[0]=midmid.num; ans=midmid.z; cnt=1; } } sort(s.begin(),s.end()); for(int i=0;i<s.size()-1;i++) { if(s[i].x==s[i+1].x&&s[i].y==s[i+1].y) { int midz=s[i].z+s[i+1].z; int mid=min(midz,s[i].y); if(ans<mid) { ansnum[0]=s[i].num; ansnum[1]=s[i+1].num; ans=mid; cnt=2; } } } cout << cnt << endl; for(int i=0;i<cnt;i++) cout << ansnum[i] << " ";}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 设计模式之单例模式
- 微信 {“errcode“: -1000}
- Vue 环境搭建
- httpclient 学习
- input表单内添加单位或者文字或者图标的方法
- CodeForces
- 网易2018校招内推--01交替串
- 用画小狗的方法来解释Java中的值传递
- 账户相关属性验证工具
- java求最大子序列
- android沉浸式状态栏、变色状态栏、透明状态栏、修改状态栏颜色及透明
- cron的使用
- elk监控tomcat日志
- Vue学习笔记十一