HDU - 4791 Alice's Print Service 二分+后缀数组最小值

题目：

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 5 ). The second line contains 2n integers s 1, p 1 , s 2, p 2 , ..., s n, p n (0=s 1 < s 2 < ... < s n ≤ 10 9 , 10 9 ≥ p 1 ≥ p 2 ≥ ... ≥ p n ≥ 0).. The price when printing no less than s i but less than s i+1 pages 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 1 .. q m (0 ≤ q i ≤ 10 9 ) 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 <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
int t;
int n,m;
ll a[maxn];
ll p[maxn];
ll pri[maxn];
ll Min[maxn];
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for (int i=0;i<n;i++)
        {
            scanf("%lld%lld",&a[i],&p[i]);
            pri[i]=a[i]*p[i];
        }
        Min[n-1]=pri[n-1];
        for (int i=n-2;i>=0;i--)
        {
            Min[i]=min(Min[i+1],pri[i]);
        }
        while(m--)
        {
            ll q;
            ll ans;
            scanf("%lld",&q);
            int loc=upper_bound(a,a+n,q)-a;
            loc--;
            if(loc==n-1)
            {
                ans=q*p[n-1];
            }
            else ans=min(q*p[loc],Min[loc+1]);
            printf("%lld\n",ans);
        }
    }
    return 0;
}