2017 Multi-University Training Contest 6 solutions 1003 Inversion
来源:互联网 发布:新丰县网络问政平台 编辑:程序博客网 时间:2024/05/28 11:49
需要统计的区间最大值次数是O(nlog(n))级别的。
时间复杂度 O(nlog(n))。
优秀的多个O(log(n))的做法也是可以卡过的。
这里介绍一下优雅的暴力做法。将A数组按值从大到小排序,对于每个下标i暴力找到最大的不被i整除的数。
时间复杂度 O(nlog(n))。
//// main.cpp// Inversion//// Created by wenhan on 2017/8/10.// Copyright �� 2017年 wenhan. All rights reserved.//#include <iostream>#include <cstdio>#include <algorithm>using namespace std;struct me{ int s; int p;}me[100000+5];int cmp(struct me a,struct me b){ if(a.s==b.s) return a.p<b.p; return a.s<b.s;}int main() { int t; scanf("%d",&t); while (t--) { int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&me[i].s); me[i].p=i; } sort(me+1, me+1+n,cmp); for(int i=2;i<=n;i++) { for(int j=n;j>=1;j--) { if(me[j].p%i!=0) { if(i==2) printf("%d",me[j].s); else printf(" %d",me[j].s); break; } } } printf("\n"); } // insert code here... //std::cout << "Hello, World!\n"; return 0;}
第一次Compilation Error,用Xcode写的注释mingw无法识别见鬼了,居然罚了20分钟(不可理喻)
把注释去掉即可ac,
现在外面交不去注释可直接ac
气!!!
阅读全文
0 0
- 2017 Multi-University Training Contest 6 solutions 1003 Inversion
- 2017 Multi-University Training Contest 6 solutions BY 福州大学
- [多校补题]2017 Multi-University Training Contest 6 solutions BY 福州大学
- 2017 Multi-University Training Contest 1 solutions BY BUAA
- 2017 Multi-University Training Contest 1 solutions BY 北京航空航天大学
- 2017 Multi-University Training Contest 1 solutions BY 北京航空航天大学
- 2017 Multi-University Training Contest 1 solutions BY 北京航空航天大学
- 2017 Multi-University Training Contest 2 solutions BY 电子科技大学
- 2017 Multi-University Training Contest 2 solutions BY UESTC
- 2017 Multi-University Training Contest 2 solutions BY 电子科技大学
- 2017 Multi-University Training Contest 3 solutions BY 洪华敦
- 2017 Multi-University Training Contest 4 solutions BY 陈松杨
- 2017 Multi-University Training Contest 5 solutions BY 吉如一
- [多校补题]2017 Multi-University Training Contest 2 solutions BY 电子科技大学
- [多校补题]2017 Multi-University Training Contest 3 solutions BY 洪华敦
- [多校补题]2017 Multi-University Training Contest 4 solutions BY 陈松杨
- 2017 Multi-University Training Contest 9 solutions 1008 Numbers(hdu6168)
- #2017 Multi-University Training Contest 2 1003
- SPOJ CIRUT(CIRU2-圆的面积并与恰被覆盖k次区域的面积)
- Unity_Unet基础使用二
- 《利用Python进行数据分析》第一章读书笔记
- Redis安装
- HDU 6098 Inversion (思维 17多校第六场)
- 2017 Multi-University Training Contest 6 solutions 1003 Inversion
- 表达式求值
- CodeVs.2370 小机房的树 ( LCA 倍增 最近公共祖先)
- 僵尸进程相关内容
- 重建二叉树
- Python语法易忘&速查笔记
- RecyclerView(六)设置下拉刷新
- QAQ & ORZ
- 正则表达式基础