Codeforces Round #321 (Div. 2) B. Kefa and Company （尺取）

排序以后枚举尾部。尺取，头部单调，维护一下就好。

排序O(nlogn),枚举O(n)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define LOCAL
const int maxn = 1e5+5;
struct Node
{int m,s;void IN(){ scanf("%d%d",&m,&s); }bool operator < (const Node&rh) const {return m < rh.m;}
}nd[maxn];ll ss[maxn];int main()
{
#ifdef LOCALfreopen("in.txt","r",stdin);
#endifint n,d; scanf("%d%d",&n,&d);for(int i = 1; i <= n; i++){nd[i].IN();}sort(nd+1,nd+1+n);for(int i = 1; i <= n; i++){ss[i] = ss[i-1]+nd[i].s;}ll ans = 0;for(int i = 1,j = 1; i <= n; i++){while(j<n && nd[j+1].m - nd[i].m < d) j++;ans = max(ans,ss[j]-ss[i-1]);}printf("%I64d",ans);return 0;
}

转载于:https://www.cnblogs.com/jerryRey/p/4831291.html

Codeforces Round #321 (Div. 2) B. Kefa and Company （尺取）相关推荐

Codeforces Round #321 (Div. 2) B. Kefa and Company 二分
B. Kefa and Company Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/580/pr ...
Codeforces Round #321 (Div. 2) C. Kefa and Park dfs
C. Kefa and Park Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/580/probl ...
Codeforces Round #321 (Div. 2) D Kefa and Dishes（dp）
用spfa,和dp是一样的.转移只和最后一个吃的dish和吃了哪些有关. 把松弛改成变长.因为是DAG,所以一定没环.操作最多有84934656,514ms跑过,实际远远没这么多. 脑补过一下费用流, ...
Codeforces Round #588 (Div. 2) F. Konrad and Company Evaluation 图论 + 建反图好题
传送门文章目录题意: 思路: 题意: 给你一张nnn个点mmm条边的图,其中每个点iii初始编号为iii,边是有向的,方向为从编号大的指向编号小的.定义一个贡献为存在某三个点a,b,ca,b,ca ...
Codeforces Round #321 (Div. 2)
水 A - Kefa and First Steps /************************************************ * Author :Running_Time ...
Codeforces Round #321 (Div. 2) Kefa and Company 二分
原题链接:http://codeforces.com/contest/580/problem/B 题意: 给你一个集合,集合中的每个元素有两个属性,$m_i,s_i$,让你求个子集合,使得集合中的最大 ...
Codeforces Round #321 (Div. 2) E
终于补好了. 题目链接: http://codeforces.com/contest/580/problem/E E. Kefa and Watch time limit per test 1 sec ...
codeforces Round #675 (Div. 2) 1422C Bargain
题目链接题目翻译: 有时候想在讲价上达成一致不是一件容易的事.现在Sasha和Vova就没法达成一致:Sasha出了一个尽可能高的价格,然后Vova想要从中去除尽可能多的数字.说得更详细一些,Sas ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...

Codeforces Round #321 (Div. 2) B. Kefa and Company （尺取）

Codeforces Round #321 (Div. 2) B. Kefa and Company （尺取）相关推荐

最新文章

热门文章