CodeForces 580B Kefa and Company
来源:互联网 发布:欧佩克石油库存数据 编辑:程序博客网 时间:2024/04/29 12:24
Kefa wants to celebrate his first big salary by going to restaurant. However, he needs company.
Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. Each friend is characterized by the amount of money he has and the friendship factor in respect to Kefa. The parrot doesn't want any friend to feel poor compared to somebody else in the company (Kefa doesn't count). A friend feels poor if in the company there is someone who has at least d units of money more than he does. Also, Kefa wants the total friendship factor of the members of the company to be maximum. Help him invite an optimal company!
The first line of the input contains two space-separated integers, n and d (1 ≤ n ≤ 105, ) — the number of Kefa's friends and the minimum difference between the amount of money in order to feel poor, respectively.
Next n lines contain the descriptions of Kefa's friends, the (i + 1)-th line contains the description of the i-th friend of type mi, si(0 ≤ mi, si ≤ 109) — the amount of money and the friendship factor, respectively.
Print the maximum total friendship factir that can be reached.
4 575 50 100150 2075 1
100
5 1000 711 3299 1046 887 54
111
In the first sample test the most profitable strategy is to form a company from only the second friend. At all other variants the total degree of friendship will be worse.
In the second sample test we can take all the friends.
这道题主要是最后的区间滚动比较难想。
听别人说二分也能做。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct person{__int64 money,fac;}a[111111];bool cmp(person a,person b){return a.money<b.money;}__int64 sum[111111];int main(){__int64 n,d,i;while(~scanf("%I64d%I64d",&n,&d)){for(i=0;i<n;i++)scanf("%I64d%I64d",&a[i].money,&a[i].fac);sort(a,a+n,cmp);sum[0]=0;for(i=1;i<=n;i++)sum[i]=sum[i-1]+a[i-1].fac;int l,r;__int64 end=0;for(l=1,r=1;l<=n,r<=n;l++){while(r<=n&&a[r-1].money-a[l-1].money<d)r++;end=max(end,sum[r-1]-sum[l-1]);}printf("%I64d\n",end);}return 0;}
- codeforces-580B Kefa and Company(二分)
- CodeForces 580B Kefa and Company
- Codeforces 580B Kefa and Company
- 【CodeForces】[580B]Kefa and Company
- CodeForces 580B Kefa and Company
- CodeForces 580B Kefa and Company
- 【CodeForces 580B】Kefa and Company
- codeforces 580B Kefa and Company
- Codeforces Round #321 (Div. 2) 580B. Kefa and Company
- CodeForces 580B Kefa and Company <贪心>
- 【CodeForces】580B - Kefa and Company(二分)
- Codeforces 580B: Kefa and Company(尺取法)
- Codeforces Round #321 B Kefa and Company
- B. Kefa and Company
- coderforce 580B Kefa and Company
- Codeforces Round #321 (Div. 2)B. Kefa and Company
- Codeforces Round #321 (Div. 2) B. Kefa and Company
- Codeforces Round #321 (Div. 2)B. Kefa and Company
- 【软件工程】滨江学院 李振宏 软件工程 考点整理
- 机房合作验收总结
- 设计模式-1、简单工厂模式
- Android 自定义View之消息提示控件
- 【机器学习入门】线性回归的概率解释
- CodeForces 580B Kefa and Company
- Spring主要核心
- 栈的实现——链表和数组
- 【软件工程】软件工程中应用的几种图辨析:系统流程图、数据流图、数据字典、实体联系图、状态转换图、层次方框图、Warnier图、IPO图、层次图、HIPO图、结构图、程序流程图、盒图、PAD图、判定表、
- Wildcard Matching
- IOS 9.3.3更后打电话没声音解决方法
- boost::asio::streambuf转std::string
- 多校 1001 Acperience
- 【软件工程】几种模型概念:瀑布模型,快速原型模型,增量模型,螺旋模型,喷泉模型