codeforces 380A. Sereja and Prefixes（折半查找）

题目链接： Codeforces Round #223 (Div. 1)  【A. Sereja and Prefixes】

n个操作，类型1，将一个数加到数组后面，类型2，将前l个数字复制c遍，然后加到数组后面

m次询问，每次输出第x个位置的数值

每次操作时用type[]记录类型，len[i]来记录第di次操作的总长度

二分查找位置x，找到这个位置后，如果属于类型1就直接输出，如果属于类型2，就继续查找

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
#define ll __int64
#define inf 100005
ll len[inf], type[inf], a[inf], c[inf], x;
int n,m;
int search(ll x)
{
	int l = 1, r = n;
	while(l < r)
	{
		int mid = (l+r)>>1;
		if(len[mid] < x) l = mid+1;
		else r = mid;  
	}
	if(type[l] == 1) return a[l];
	x = x-len[l-1];
	x = x%a[l];
	if(x == 0) x = a[l];
	return search(x);
}
int main()
{
	memset(type, 0, sizeof(type));
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &type[i]);
		if(type[i] == 1)
		{
			scanf("%d", &a[i]);
			len[i] = len[i-1]+1;
		}
		else 
		{
			scanf("%d%d", &a[i], &c[i]);
			len[i] = len[i-1]+(ll)a[i]*c[i];
		}
	}
	scanf("%d", &m);
	for(int i = 0; i < m; i++)
	{
		scanf("%I64d", &x);
		if(i == m-1) printf("%d\n",search(x));
		else printf("%d ", search(x));
	}
	return 0;
}