P4085 [USACO17DEC]Haybale Feast

最新推荐文章于 2021-08-28 23:31:23 发布

qq_32261381

最新推荐文章于 2021-08-28 23:31:23 发布

阅读量231

点赞数

分类专栏： RMQ

本文链接：https://blog.csdn.net/qq_32261381/article/details/81161015

版权

RMQ 专栏收录该内容

0 篇文章 0 订阅

订阅专栏

题意翻译

题意：给定2个由N个数字组成的数列 F , S ,需要找到使得

\sum k = i j F k ⩾ M

$\sum_{k=i}^j F_k⩾M$ 的 i , j 并输出在所有满足条件的 i , j 中，

max (S i, S i + 1, . . . S j - 1, S j)

$\max(S_i,S_{i+1},...S_{j-1},S_{j})$ 的最小值。

题目描述

Farmer John is preparing a delicious meal for his cows! In his barn, he has N haybales

(1 \leq N \leq 100, 000)

$( 1\leq N \leq 100,000)$ . The i th haybale has a certain flavor

F i (1 \leq F i \leq 109)

$F_i( 1 \le F_i \le 10^9)$ and a certain spiciness

S i (1 \leq S i \leq 109)

$S_i ( 1 \le S_i \le 10^9)$ .

The meal will consist of a single course, being a contiguous interval containing one or more consecutive haybales (Farmer John cannot change the order of the haybales). The total flavor of the meal is the sum of the flavors in the interval. The spiciness of the meal is the maximum spiciness of all haybales in the interval.

Farmer John would like to determine the minimum spiciness his single-course meal could achieve, given that it must have a total flavor of at least

M (1 \leq M \leq 1018)

$M ( 1 \le M \le 10^{18})$ .

输入输出格式

输入格式：

The first line contains the integers N and M , the number of haybales and the minimum total flavor the meal must have, respectively. The next N lines describe the N haybales with two integers per line, first the flavor F and then the spiciness S .

输出格式：

Please output the minimum spiciness in a single course meal that satisfies the minimum flavor requirement. There will always be at least one single-course meal that satisfies the flavor requirement.

输入输出样例

输入样例#1：

5 10
4 10
6 15
3 5
4 9
3 6

输出样例#1：

#include<bits/stdc++.h>
#define LL long long
#define initt(n,m) scanf("%lld%lld",&n,&m);
using namespace std;
struct ppp {
    LL int num,data;
};
bool cmp(const ppp &a,const ppp &b) {
    return a.data<b.data;
}
const int L=1e+5;
LL int n,m,f[L],s[L],sum[L];
ppp w[L];
LL int work(ppp x) {
    int mid,l,r;
    mid=l=r=x.num;
    for(int j=mid-1; j>=1; j--) {
        if(s[j]>x.data)
            break;
        l=j;
    }
    for(int j=mid+1; j<=n; j++) {
        if(s[j]>x.data)
            break;
        r=j;
    }
    if(sum[r]-sum[l-1]>=m)
        return x.data;
    return -1;
}
int main() {
    initt(n,m);
    for(int i=1; i<=n; i++) {
        scanf("%lld%lld",&f[i],&s[i]);
        sum[i]=sum[i-1]+f[i];
        w[i].data=s[i];
        w[i].num=i;
    }
    sort(w+1,w+n+1,cmp);
    for(int i=1; i<=n; i++) {
        LL  t=work(w[i]);
        if(t!=-1) {
            printf("%lld",t);
            return 0;
        }
    }
    return 0;
}