ZOJ3726 Alice's Print Service（二分）

最新推荐文章于 2019-08-27 16:56:00 发布

RuHua27

最新推荐文章于 2019-08-27 16:56:00 发布

阅读量383

点赞数

分类专栏：二分水题 ZOJ Regional

本文链接：https://blog.csdn.net/u013112097/article/details/38322369

版权

水题同时被 3 个专栏收录

18 篇文章 0 订阅

订阅专栏

ZOJ

4 篇文章 0 订阅

订阅专栏

Regional

4 篇文章 0 订阅

订阅专栏

二分即可，注意有的价格会“覆盖”后面的价格。

#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long LL;
const int maxn = 1e5+100;
LL s[maxn], p[maxn];

int main()
{
    int t;

    for (scanf("%d", &t); t--;) {
        int n, m;
        scanf("%d%d", &n, &m);
        for (int i = 0; i < n; i++)
            scanf("%lld%lld", &s[i], &p[i]);
        for (int i = n-1; i > 0; i--) {
            if (s[i] * p[i] < s[i-1] * p[i-1]) {
                s[i-1] = s[i];
                p[i-1] = p[i];
            }
        }
        for (int i = 0; i < m; i++) {
            LL q;
            scanf("%lld", &q);
            if (q >= s[n-1]) {
                printf("%lld\n", q*p[n-1]);
                continue;
            }
            int lf = 0, rt = n-2, mid = 0;
            while (lf < rt) {
                mid = (lf + rt) / 2;
                if (q >= s[mid] && q < s[mid+1])
                    break;
                else if (q < s[mid])
                    rt = mid-1;
                else
                    lf = mid+1;
            }
            mid = (lf + rt) / 2;
            LL ans = q*p[mid];
            if (mid+1<n)
                ans = min(ans, s[mid+1]*p[mid+1]);
            printf("%lld\n", ans);
        }
    }

    return 0;
}
/*
10 6 100
0 100 5 50 60 20 100 10 300 2 900 1

*/