Hdu6098 Inversion(2017多校第6场)
来源:互联网 发布:义乌淘宝美工学校 编辑:程序博客网 时间:2024/05/17 08:52
Inversion
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 271 Accepted Submission(s): 183
Problem Description
Give an array A, the index starts from 1.
Now we want to knowBi=maxi∤jAj , i≥2 .
Now we want to know
Input
The first line of the input gives the number of test cases T; T test cases follow.
Each case begins with one line with one integer n : the size of array A.
Next one line contains n integers, separated by space, ith number isAi .
Limits
T≤20
2≤n≤100000
1≤Ai≤1000000000
∑n≤700000
Each case begins with one line with one integer n : the size of array A.
Next one line contains n integers, separated by space, ith number is
Limits
Output
For each test case output one line contains n-1 integers, separated by space, ith number is Bi+1 .
Sample Input
241 2 3 441 4 2 3
Sample Output
3 4 32 4 4
Source
2017 Multi-University Training Contest - Team 6
——————————————————————————————————
题目的意思是给出一个序列,求2~n每一个数,下标不是这个数倍数的最大值是什么?
思路:从大到小排个序,然后枚举判下表是否为这个数的倍数
#include <iostream>#include <cstdio>#include <cstring>#include <map>#include <set>#include <string>#include <cmath>#include <algorithm>#include <vector>#include <bitset>#include <stack>#include <queue>#include <unordered_map>#include <functional>using namespace std;struct node{int id,v;}a[100005];bool cmp(node x,node y){ return x.v>y.v;}int main(){ int T,n; for(scanf("%d",&T);T--;) { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i].v),a[i].id=i; sort(a+1,a+1+n,cmp); int q=0; for(int i=2;i<=n;i++) { int k=1; while(a[k].id%i==0) { k++; } if(q++) printf(" "); printf("%d",a[k].v); } printf("\n"); } return 0;}
阅读全文
0 0
- Hdu6098 Inversion(2017多校第6场)
- HDU6098 Inversion(RMQ,2017 HDU多校联赛 第6场)
- hdu6098 Inversion 2017多校第六场1003 埃氏筛法
- HDU6098-2017多校6-贪心&水-Inversion
- 2017杭电多校联赛6-Inversion-排序-hdu6098
- HDU6098 Inversion -2017多校联盟6 第3题
- HDU6098 Inversion
- HDU6098(Inversion)
- HDU6098-Inversion
- HDU6098 Inversion
- HDU6098-Inversion
- hdu6098--Inversion
- HDU6098 Inversion 签到
- 2017杭电多校第六场 1003 Inversion(暴力)HDU 6098
- hdu6098
- 2017杭电多校第六场03Inversion
- hdu 4911 Inversion (多校第5场,求逆序数对,离散化)
- 2017 多校训练第六场 HDU 6098 Inversion
- protobuf
- 每日一题——判断二叉树是否平衡,求一棵二叉树的镜像
- 方法内部类
- 小结 | 函数的调用过程(栈帧)
- 安卓工作室android studio 美化 ,设置背景图片。
- Hdu6098 Inversion(2017多校第6场)
- spring mvc基础篇(十二):综合案例一
- 8.10抽象类与接口
- CentOS下安装Python3后BeautifulSoup 版本不兼容问题解决方法
- [编程题] Fibonacci数列
- ubuntu server 16.04安装与网络配置
- android studio 代码模板
- fragment 切换,导航栏是图标加文字
- MySQL 调优/优化的 100 个建议