CF 380A Sereja and Prefixes binary search, brute force

#include<iostream>
#include<cstring>
#define ll long long int
using namespace std;

int m,n;
ll range[100001];
ll num[100001];
ll pp[100001];

ll bin_search(ll rt){
	ll high,low,mid;
	mid = -1;
	high = m - 1;
	while(mid == -1 || num[mid] == -1){
		low = 0;
		while(low<=high){
			mid = (high + low) >> 1;
		//	cout<<low<<" "<<high<<" "<<mid<<endl;
			if(rt <= range[mid] && range[mid-1] < rt)
				break;
			else if(range[mid] < rt)
				low = mid + 1;
			else
				high = mid - 1;
		}
	//	cout<<endl;
		if(num[mid] != -1) 
			return num[mid];
		rt = ((rt - range[mid-1])-1)%pp[mid] + 1;
	}
	return rt;
}

int main(){
	memset(num,0,sizeof(num));
	cin>>m;
	ll nmax=1;
	for(int i = 0; i < m; i++){
		ll tmp1,tmp2,tmp3;
		cin>>tmp1;
		if(tmp1 == 1){
			cin>>tmp2;
			range[i] = nmax++;
			num[i] = tmp2;
		}
		else{
			cin>>tmp2>>tmp3;
			range[i] = nmax + tmp2 * tmp3 - 1;
			pp[i] = tmp2;
			nmax += tmp2 * tmp3;
			num[i] = -1;
		}
	}
	cin>>n;
	while(n--){
		ll tmp1;
		cin>>tmp1;
		cout<<bin_search(tmp1)<<" ";
	}
	cout<<endl;
	return 0;
}

本题给定两个操作

1.在序列最后面添加一个数。

2.将前面k个数复制i遍放在序列最后。

用一个数组range保存每次操作之后序列的长度。另外对于操作1需保存添加的数

对于每个要求的第n个数，在range中二分查找相应的位置，一步步缩小n直到第n个数就是第一个操作产生的而不是复制产生的。