CodeForces 535C(数列处理)

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring> 
using namespace std;
const int MAXN = 1000000;
typedef long long LL;

LL A,B,n;
LL l,t,m;

// s[i] = A + (i-1) * B


/*
CF 535C 
关键: 
①注意运算过程中int是否会越界, 会则需要改成long long
②二分法(只是加速): 从第L棵到右边能吃到的最高那棵(即高度恰小于t的)所围成的区间内, 用二分查找法, 确定恰好满足sum<=m*t的一个区间(左端点必须为第L棵,只需确定右端)
③记得二分查找的结束条件: 缩小范围至范围变为0为止
4.可以吃完最前面的然后往后吃? 
5.l~r这些个都是要吃完的 

*/
LL f(LL r){
	return A+(r-1)*B;
}

int main(){
	scanf("%I64d %I64d %I64d", &A, &B, &n);
	for(int i=0; i<n; i++){
		scanf("%I64d %I64d %I64d",&l,&t,&m);
		LL first = A + (l-1)*B;
		if( first>t ){					// 无法找到r的唯一情况 
			cout << -1 << endl;
			continue;
		}else{
			LL sum,mid,left,right,ans;	// mid是最终要的那个数列的右端点 
			left = l;			// left不是l,只是临时作为一个查找的边界 
			right = (t-A)/B+1;	// 最多能吃到的那棵
//			cout << "---------------------------------" << endl;
			while( left<=right ){
				mid = (left+right)>>1;
				sum = (f(l)+f(mid))*(mid-l+1)>>1;				// *比>>优先级高
// 				cout << "left = " << left << ", right = " << right << ", sum = " << sum << endl;
				if( sum<=m*t ){
					ans = mid;					// 因为有可能最后退出的前一次mid已经超了 
					left = mid+1;
//					cout << "left+=1" << endl;
				}else{
					right = mid-1;;
//					cout << "right+=1" << endl;
				}
			}
			cout << ans << endl;
		}
	}
	return 0;
}