Different GCD Subarray Query HDU - 5869 线段树+离线处理

原创

于 2019-08-12 15:28:34 发布 · 202 阅读

CC 4.0 BY-SA版权

这是一道关于最大公约数（GCD）的数学问题。题目要求在给定的正整数数组中，对于每个查询区间[L, R]，找出所有子数组的不同GCD种类数量。解决方案涉及到离线处理和线段树数据结构的应用。" 111440762,10294259,Python实现局域网文件传输：socket服务器与客户端,"['Python', 'socket编程', '文件操作', '网络通信']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This is a simple problem. The teacher gives Bob a list of problems about GCD (Greatest Common Divisor). After studying some of them, Bob thinks that GCD is so interesting. One day, he comes up with a new problem about GCD. Easy as it looks, Bob cannot figure it out himself. Now he turns to you for help, and here is the problem:

  Given an array aa of NN positive integers a1,a2,⋯aN−1,aNa1,a2,⋯aN−1,aN; a subarray of aa is defined as a continuous interval between a1a1 and aNaN. In other words, ai,ai+1,⋯,aj−1,ajai,ai+1,⋯,aj−1,aj is a subarray of aa, for 1≤i≤j≤N1≤i≤j≤N. For a query in the form (L,R)(L,R), tell the number of different GCDs contributed by all subarrays of the interval [L,R][L,R].

Input

There are several tests, process till the end of input.

For each test, the first line