hdu4791-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): 1570    Accepted Submission(s): 372

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+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 ₁ .. 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
  
  

 

题意： 打印东西，给出区间（张数）对应费用（到达一定张数就都按某更低的价格），m次询问，问最优费用。给的时候按张数递增给的。

思路：看见网上的大神用线段树或者dp做这道题，我表示无语。

像这种询问次数暴多、每次询问查找思路一样、数据还是有序的，简单暴力搜索就好啦！

把价格区间存好，并计算区间当前最小花费存入。存入所有询问数。将边数与询问数同时增加来进行符合比较，得出所求值。

再按原先记录的顺序输出！OK！收工！

分析一下复杂度。虽然是暴力搜索，但m次询问整体只搜索一遍，所以复杂度是o（n）

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
struct qq
{
    ll l,id;
    friend bool operator <(const qq &a,const qq &b)
    {
        return a.l<b.l;
    }
}q[100005];
ll anw[100005];
ll a[100005][3];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++){scanf("%lld %lld",&a[i][0],&a[i][1]);}
        ll minn=a[n][0]*a[n][1];
        for(int i=n-1;i>=1;i--){a[i][2]=minn;minn=min(minn,a[i][0]*a[i][1]);}
        for(int i=1;i<=m;i++){scanf("%d",&q[i].l),q[i].id=i;}
        sort(q+1,q+1+m);
        int i=1,j=1;
        a[n+1][0]=1000000005;
        a[n][2]=99999999999999999;
        while(i<=n)
        {
            for(;j<=m&&q[j].l<a[i+1][0];j++)
            {
                anw[q[j].id]=min(a[i][2],a[i][1]*q[j].l);
            }
            i++;
        }
        for(int k=1;k<=m;k++)
            printf("%lld\n",anw[k]);
    }
    return 0;
}

复制去Google翻译 翻译结果