CodeForces 580B Kefa and Company
2016-07-21 19:30
363 查看
B. Kefa and Company
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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!
Input
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.
Output
Print the maximum total friendship factir that can be reached.
Examples
input
output
input
output
Note
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;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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!
Input
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.
Output
Print the maximum total friendship factir that can be reached.
Examples
input
4 5 75 5 0 100 150 20 75 1
output
100
input
5 1000 7
11 32
99 10
46 8
87 54
output
111
Note
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;
}
相关文章推荐
- centos7上memcahed安装
- HDU 1513 Palindrome(LCS+滚动数组)
- Wildcard Matching
- json-lib-2.4.jar Bug,json字符串中value为"[value]"结构时,解析为数组,不会解析成字符串
- 栈的实现——链表和数组
- [网络流]poj2112 Optimal Milking
- noip 2014 提高组 Day 2
- 【软件工程】软件工程中应用的几种图辨析:系统流程图、数据流图、数据字典、实体联系图、状态转换图、层次方框图、Warnier图、IPO图、层次图、HIPO图、结构图、程序流程图、盒图、PAD图、判定表、
- 在创建窗口句柄之前,不能在控件上调用 Invoke 或 BeginInvoke
- Python学习-反射相关函数
- 设计模式-1、简单工厂模式
- 【机器学习入门】线性回归的概率解释
- 构造方法的重载
- 【软件工程】滨江学院 李振宏 软件工程 考点整理
- hdu 2647(拓扑排序)
- java基础Day02
- 引导页-通过简单的方法给app加入简单的引导页面
- LeetCode 371. Sum of Two Integers
- javascript event(事件对象)详解
- 2016 Multi-University Training Contest 2