题目描述
题目分析
这道题可谓是花费了我两个学习周期的时间。
分析题目,说的是一串有规律的数字,求第k位。由于数据巨大,打表只能拿60分,所以我们使用二分求解。
做这道题我的思路是逐步定位,精确求解。
- 构造出block结构体,9块足以达到longlong最大值,存储d位数字块的信息,包括公差,第一个数,最后一个数,第一个数宽度,最后一个数宽度,前缀和。在主函数最开始对其初始化。
- 读入的k先判断它属于哪一个块,并对其前面的数字进行截断。如k=46–>k=1。
- 接下来是最细节的地方,二分查找k属于的数字串。如46对应10,57对应11。每次等比数列求和计算块头到mid的总长度,然后根据条件二分。之后对k进行第二次截断,如k=12–>k=1(剪掉了宽度为11的10)
- 接下来任务就转换成了给定123456789101112…的序列,求第k位的数值。使用string s = to_string(base);处理此类问题比较简单。
长长记性
- pow()函数的返回值是double类型,对于长整型的强制类型转换会损失精度,比如9999999999.999999变为9999999999,比原来小了1。
- 二分时候一定要注意不要出现死循环,不要出现边界错误,while()内尽量取等号。
代码
#include <iostream>
#include<cmath>
#include<string>
#include<cstring>
#define ll long long
using namespace std;
struct block
{
ll d;//公差
ll first;//第一个数
ll last;//最后一个数
ll first_span;//第一个数宽度
ll last_span;//最后一个数宽度
ll sum;//前缀和
}blk[10];//sum[9]=4393939398494949376 19位
int main()
{
memset(blk, 0, sizeof(blk));
ll remember = 1;
for (int i = 1; i <= 9; i++)
{//初始化每个块
blk[i].d = i;
//blk[i].first = pow(10, i - 1);
blk[i].first = remember;
//blk[i].last = pow(10, i) - 1;
blk[i].last = remember*10-1;
blk[i].first_span = blk[i - 1].last_span + i;
//blk[i].last_span = blk[i - 1].last_span + 9 * pow(10, i - 1) * i;
blk[i].last_span = blk[i - 1].last_span + 9 * remember * i;
//blk[i].sum = blk[i - 1].sum + (blk[i].first_span + blk[i].last_span) * 9 * pow(10, i - 1) / 2;
blk[i].sum = blk[i - 1].sum + (blk[i].first_span + blk[i].last_span) * 9 * remember / 2;
remember *= 10;
//cout << blk[i].d << ' ' << blk[i].first << ' ' << blk[i].last << ' ' << blk[i].first_span << ' ' << blk[i].last_span << ' ' << blk[i].sum << endl;
}
ll q;//q<=500
ll k;//k<=1e18
ll blk_num;//块号
cin >> q;
while (q--)
{
blk_num = 1;//块号
cin >> k;
//cout << "起始k" << k << endl;
for (int i = 1; i <= 9; i++)
{
if (blk[i].sum < k)blk_num++;
}
k -= blk[blk_num - 1].sum;//对齐
//cout << "块号"<<blk_num<<"第一次调完k" << k << endl;
ll l = blk[blk_num].first;
ll r = blk[blk_num].last;
ll mid;
ll mid_span;
while (l<=r)
{
mid = (l + r) >> 1;
//cout << "mid" << mid << endl;
mid_span = blk[blk_num].first_span + (mid - blk[blk_num].first) * blk[blk_num].d;
//cout << "mid_span" << mid_span << endl;
if ((blk[blk_num].first_span + mid_span) * (mid - blk[blk_num].first + 1) / 2 < k)l = mid + 1;
else r = mid-1;
//cout << "l" << l << endl;
//cout << "r" << r << endl;
}
if (k<= blk[blk_num].first_span);//k在每段的第一个数区间内,不减
else
{
l -= 1;
ll l_span = blk[blk_num].first_span + (l - blk[blk_num].first) * blk[blk_num].d;
k -= (blk[blk_num].first_span + l_span) * (l - blk[blk_num].first + 1) / 2;//对齐
}
//cout << "块号" << blk_num << "第二次调完k" << k << endl;
ll temp = 9;
ll cnt = 1;
ll cnt_sum;
while (k> temp*cnt)
{//把k调到自己的位数区间
cnt_sum = temp * cnt;
k -= cnt_sum;
temp *= 10;
cnt++;
}
//k = k - 1;
//ll base = pow(10, cnt - 1) + k / cnt;
//ll add = k % cnt;
ll base = pow(10, cnt - 1) + k / cnt;
ll add = k % cnt;
if (add == 0)
{
base -= 1;
string s = to_string(base);
ll length = s.size();
cout << s[length-1] << endl;
}
else
{
string s = to_string(base);
cout << s[add-1] << endl;
}
//cout << "base" << base << "add" << add << "cnt" << cnt;
}
return 0;
}