BAPC 2016 The 2016 Benelux Algorithm Programming Contest-----L Sticky Situation
来源:互联网 发布:南丰县招聘网络 编辑:程序博客网 时间:2024/06/14 18:29
BAPC 2016
The 2016 Benelux Algorithm Programming Contest
这次比赛真的是很丢人啊,开始的时候,自己真的是静不下心来,读题一点也不认真,看到英文真的是一点也不想翻译……觉得自己这样真的是很不好,要不断的调整。这次真的是做到心态崩了,以至于到最后,自己都放弃了,然后就一直想起假期的那件事,一边想要放弃,一边想要坚持,感觉自己都快分裂了,真的是很难受。
说说这题吧,其实,比赛的时候看的很快,大约是看懂题意了,给出一些数,看看是否可以组成三角形,但是自已觉得不能一个一个的比较,不然的话,O(N^3)会超时,然后就又想是不是可以有比较特殊的判断方法,接着,就在这条错误的道路上越走越远……
比赛结束后,问了问别人的方法,据说是只要排个序,然后三个三个比较就可以(法二),然后我就想起来了我开始的时候的思路,赛后又写了一遍,提交居然不会超时,我一点也开心不起来……
法一:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;long long int a[1212121];void maxx(int *x, int *y, int *z)//三者的顺序{ int aa[3]; aa[0] = *x; aa[1] = *y; aa[2] = *z; sort(aa, aa+3); *x = aa[0]; *y = aa[1]; *z = aa[2];}int main(){ int n; scanf("%d", &n); for(int i=0;i<n;i++) { scanf("%lld", &a[i]); } int flag = 0; for(int i=0;i<n;i++)//三层循环 { for(int j=0;j<n;j++) { for(int k=0;k<n;k++) { if(i!=j&&i!=k&&k!=j) { int x = a[i]; int y = a[j]; int z = a[k]; maxx(&x, &y, &z); if(x+y>z)//两边之和大于第三边 { flag = 1; break; } } } if(flag) break; } if(flag) break; } if(flag) cout<<"possible"<<endl; else cout<<"impossible"<<endl; return 0;}
法二:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;long long int a[1212121];void maxx(int *x, int *y, int *z){ int aa[3]; aa[0] = *x; aa[1] = *y; aa[2] = *z; sort(aa, aa+3); *x = aa[0]; *y = aa[1]; *z = aa[2];}int main(){ int n; scanf("%d", &n); for(int i=0;i<n;i++) { scanf("%lld", &a[i]); } int flag = 0; sort(a, a+n);//排序 for(int i=0;i<n-2;i++)//一层循环,相邻的三个比较 { int x = a[i]; int y = a[i+1]; int z = a[i+2]; maxx(&x, &y, &z); if(x+y>z)//三角形的判断条件 { flag = 1; break; } } if(flag) cout<<"possible"<<endl; else cout<<"impossible"<<endl; return 0;}
阅读全文
0 0
- BAPC 2016 The 2016 Benelux Algorithm Programming Contest-----L Sticky Situation
- BAPC 2016 The 2016 Benelux Algorithm Programming Contest------I: Older Brother
- 2014 Benelux Algorithm Programming Contest (BAPC 14)
- 2007 Benelux Algorithm Programming Contest (BAPC 2007) A
- 2014 Benelux Algorithm Programming Contest (BAPC 14) 部分题解
- 2014 Benelux Algorithm Programming Contest (BAPC 14) K
- The 2006 Benelux Algorithm Programming Contest 解题报告
- The 8th Zhejiang Provincial Collegiate Programming Contest / L - Javabeans
- The 12th Zhejiang Provincial Collegiate Programming Contest - L
- The 8th Zhejiang Provincial Collegiate Programming Contest->L - Javabeans
- 计蒜客ACM ICPC 2017 Warmup Contest 9--I题-Sticky Situation
- 【ZOJ3957 The 17th Zhejiang University Programming Contest J】【水题】Knuth-Morris-Pratt Algorithm
- The 13th UESTC Programming Contest Preliminary—— L - Lovely princess
- Programming Challenges: The Programming Contest Training Manual
- 2016 浙江省赛 The 13th Zhejiang Provincial Collegiate Programming Contest I题
- 2016 浙江省赛 The 13th Zhejiang Provincial Collegiate Programming Contest K题 SPFA
- 2016 浙江省赛 The 13th Zhejiang Provincial Collegiate Programming Contest D题 循环节
- 【Codeforces】2015-2016 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2015) A Adjoin the Netwo
- java 导出excle
- HTML 5 Web 存储
- vs2013+qt+opencv3.0配置
- 【51Nod】1384 全排列
- Linux -- ftp命令的用法
- BAPC 2016 The 2016 Benelux Algorithm Programming Contest-----L Sticky Situation
- elasticsearch+logstash+kibana5.5.2集成searchguard实现用户权限管理(一)
- 学习软件开发的心得
- 单片机的仿真器
- POJ
- MQC功能测试大揭秘(2)- Appium环境搭建
- [日推荐]『本本海报』内含程序员福利,不可描述~
- awk 从入门到精通
- 配对堆