【UVA】10012 - How Big Is It?(暴力)
来源:互联网 发布:知君本无邪by尼罗txt 编辑:程序博客网 时间:2024/06/17 05:26
利用DFS枚举所有排列,之后每次添加一个圆的时候,他的位置是和前面所有已经添加圆的相切的位置的最大。
1438363510012How Big Is It?AcceptedC++0.0862014-10-20 11:07:33
#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;typedef double Dou;#define FOR(i,n) for(int i = 0; i < n; i ++)const int maxn = 10;int n,vis[maxn];Dou ans,r[maxn];struct POS{ //圆心位置就是(x,r) Dou x,r; //横坐标,半径}pos[maxn];Dou check(int cur,int k){ Dou ret = r[k]; FOR(i,cur){ Dou a = pos[i].r + r[k]; Dou b = pos[i].r - r[k]; Dou c = sqrt(a * a - b * b); ret = max(ret,pos[i].x + c); } pos[cur].x = ret; pos[cur].r = r[k]; return ret + r[k];}void dfs(int cur,double L){ if(ans != -1 && L > ans) return; if(cur == n){ Dou ret; for(int i = 0; i < cur; i++){ if(i == 0) ret = pos[i].x + pos[i].r; else ret = max(ret,pos[i].x + pos[i].r); } ans = (ans == -1) ? ret : min(ans,ret); return; } FOR(i,n) if(!vis[i]){ vis[i] = 1; dfs(cur + 1,check(cur,i)); vis[i] = 0; } return;}int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d",&n); ans = -1; memset(vis,0,sizeof(vis)); FOR(i,n) scanf("%lf",&r[i]); dfs(0,0.0); printf("%.3f\n",ans); } return 0;}
0 0
- UVA 10012 How Big Is It?(暴力枚举)
- 【UVA】10012 - How Big Is It?(暴力)
- UVA 10012 - How Big Is It 暴力 回溯 全排列
- uva 10012 how big is it?
- uva 10012 How Big Is It?
- uva 10012 - How Big Is It?
- UVa 10012 - How Big Is It?
- [uva] 10012 - How Big Is It?
- UVa 10012 - How Big Is It?
- UVa 10012 - How Big Is It?
- uva 10012 How Big Is It?
- uva 10012 - How Big Is It?
- UVA 10012 How Big Is It?
- uva 10012How Big Is It?
- UVA - 10012 How Big Is It?
- UVA 10012 How Big Is It?
- uva 10012How Big Is It?
- uva 10012 - How Big Is It?(排列 + 回溯)
- 五大常用算法之三:贪心算法(红脸书生)
- codeforces-#479B. Towers(模拟)
- 项目总结
- HEVC-配置文件解读
- 五大常用算法之五:分支限界法(红脸书生)
- 【UVA】10012 - How Big Is It?(暴力)
- c++ 虚函数 构造函数 析构函数
- webservice 完整 实现方式 服务端 客户端 (cxf)
- 五大常用算法之四:回溯法(红脸书生)
- 集线器,转发器,网桥,以太网交换机
- C语言_循环结构
- JAVA CP命令
- hdu 4902 Nice boat 线段树
- C++学习笔记