HDU 4791 Alice’s Print Service

题目：

Alice’s Print Service

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1596    Accepted Submission(s): 380

Problem Description

Alice is providing print service, while the pricing doesn’t seem to be reasonable, so people using her print service found some tricks to save money.
For example, the price when printing less than 100 pages is 20 cents per page, but when printing not less than 100 pages, you just need to pay only 10 cents per page. It’s easy to figure out that if you want to print 99 pages, the best choice is to print an extra blank page so that the money you need to pay is 100 × 10 cents instead of 99 × 20 cents.
Now given the description of pricing strategy and some queries, your task is to figure out the best ways to complete those queries in order to save money.

 

Input

The first line contains an integer T (≈ 10) which is the number of test cases. Then T cases follow.
Each case contains 3 lines. The first line contains two integers n, m (0 < n, m ≤ 10 ⁵ ). The second line contains 2n integers s ₁, p ₁ , s ₂, p ₂ , …, s _n, p _n (0=s ₁ < s ₂< … < s _n ≤ 10 ⁹ , 10 ⁹ ≥ p ₁ ≥ p ₂ ≥ … ≥ p _n ≥ 0).. The price when printing no less than s _i but less than s _i+1pages is p _i cents per page (for i=1..n-1). The price when printing no less than s _n pages is p _n cents per page. The third line containing m integers q ₁.. q _m (0 ≤ q _i ≤ 10 ⁹ ) are the queries.

 

Output

For each query q _i, you should output the minimum amount of money (in cents) to pay if you want to print q _i pages, one output in one line.

 

Sample Input

  
  

   
   1
2 3
0 20 100 10
0 99 100
  
  

 

Sample Output

  
  

   
   0
1000
1000
  
  

 

代码：

#include "stdafx.h"
#include <iostream>
#include <vector>

using namespace std;

int  Pretreatment(vector<int> s,vector<int> p,vector<int> &pretre) //预处理函数
{
	pretre.push_back(0);
	int temp;
	for (int i = 1; i < s.size(); i++)
	{
		temp = (s[i] * p[i]) / p[i - 1];
		pretre.push_back(temp);
		pretre.push_back(s[i]);
	}
	return 0;
}

int main() 
{
	int T;//实验次数
	int n, m, temp, q;
	cin >> T;
	//cout << endl;
	cin >> n >> m;
	vector<int> s;//储存页数区间
	vector<int> p;//储存区间价格
	vector<int> pretre;

	for (int i = 0; i < n; i++)//初始化s,p
	{
		cin >> temp;
		s.push_back(temp);
		cin >> temp;
		p.push_back(temp);
	}

	Pretreatment(s, p, pretre);//预处理页数与价格

	temp = 0;
	int index = pretre.size();
	while (temp < m)   //对输入页数进行判断输出最优价格
	{
		cin >> q;
		if (q == 0)
		{
			cout << 0 << endl;
		}
		else if (q >= s[n - 1])
		{
			cout << q*p[n - 1] << endl;
		}
		else {
			for (int i = 0; i < index - 1; i++)
			{
				if (q > pretre[i] && q < pretre[i + 1])
				{
					if (i % 2 == 0)
					{
						cout << q*p[i] << endl;
						continue;
					}
					else {
						cout << s[i / 2 + 1] * p[i / 2 + 1] << endl;
						continue;
					}
				}
			}
		}
		temp++;
	}	
}