Stars in Your Window
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 13196   Accepted: 3609

Description

Fleeting time does not blur my memory of you. Can it really be 4 years since I first saw you? I still remember, vividly, on the beautiful Zhuhai Campus, 4 years ago, from the moment I saw you smile, as you were walking out of the classroom and turned your head back, with the soft sunset glow shining on your rosy cheek, I knew, I knew that I was already drunk on you. Then, after several months’ observation and prying, your grace and your wisdom, your attitude to life and your aspiration for future were all strongly impressed on my memory. You were the glamorous and sunny girl whom I always dream of to share the rest of my life with. Alas, actually you were far beyond my wildest dreams and I had no idea about how to bridge that gulf between you and me. So I schemed nothing but to wait, to wait for an appropriate opportunity. Till now — the arrival of graduation, I realize I am such an idiot that one should create the opportunity and seize it instead of just waiting.

These days, having parted with friends, roommates and classmates one after another, I still cannot believe the fact that after waving hands, these familiar faces will soon vanish from our life and become no more than a memory. I will move out from school tomorrow. And you are planning to fly far far away, to pursue your future and fulfill your dreams. Perhaps we will not meet each other any more if without fate and luck. So tonight, I was wandering around your dormitory building hoping to meet you there by chance. But contradictorily, your appearance must quicken my heartbeat and my clumsy tongue might be not able to belch out a word. I cannot remember how many times I have passed your dormitory building both in Zhuhai and Guangzhou, and each time aspired to see you appear in the balcony or your silhouette that cast on the window. I cannot remember how many times this idea comes to my mind: call her out to have dinner or at least a conversation. But each time, thinking of your excellence and my commonness, the predominance of timidity over courage drove me leave silently.

Graduation, means the end of life in university, the end of these glorious, romantic years. Your lovely smile which is my original incentive to work hard and this unrequited love will be both sealed as a memory in the deep of my heart and my mind. Graduation, also means a start of new life, a footprint on the way to bright prospect. I truly hope you will be happy everyday abroad and everything goes well. Meanwhile, I will try to get out from puerility and become more sophisticated. To pursue my own love and happiness here in reality will be my ideal I never desert.

Farewell, my princess!

If someday, somewhere, we have a chance to gather, even as gray-haired man and woman, at that time, I hope we can be good friends to share this memory proudly to relight the youthful and joyful emotions. If this chance never comes, I wish I were the stars in the sky and twinkling in your window, to bless you far away, as friends, to accompany you every night, sharing the sweet dreams or going through the nightmares together. 

Here comes the problem: Assume the sky is a flat plane. All the stars lie on it with a location (x, y). for each star, there is a grade ranging from 1 to 100, representing its brightness, where 100 is the brightest and 1 is the weakest. The window is a rectangle whose edges are parallel to the x-axis or y-axis. Your task is to tell where I should put the window in order to maximize the sum of the brightness of the stars within the window. Note, the stars which are right on the edge of the window does not count. The window can be translated but rotation is not allowed. 

Input

There are several test cases in the input. The first line of each case contains 3 integers: n, W, H, indicating the number of stars, the horizontal length and the vertical height of the rectangle-shaped window. Then n lines follow, with 3 integers each: x, y, c, telling the location (x, y) and the brightness of each star. No two stars are on the same point.

There are at least 1 and at most 10000 stars in the sky. 1<=W,H<=1000000, 0<=x,y<2^31.

Output

For each test case, output the maximum brightness in a single line.

Sample Input

3 5 4
1 2 3
2 3 2
6 3 1
3 5 4
1 2 3
2 3 2
5 3 1

Sample Output

5
6

Source

思路:

将一个点看成一个矩阵的左下角,然后扫描线+线段树维护最多存了多少条下边就可以了。

实现代码:

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll __int64
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mid ll m = (l + r) >> 1
const ll M = 1e5+;
ll sum[M<<],lazy[M<<],x[M];
struct seg{
ll l,r,h,s;
seg(){}
seg(ll a,ll b,ll c,ll d):l(a),r(b),h(c),s(d){}
bool operator < (const seg &cmp) const {
if(h == cmp.h) return s < cmp.s; //因为边界上的点不算,所以优先计算上边。
return h < cmp.h;
}
}t[M]; void pushup(ll rt){
sum[rt] = max(sum[rt<<] ,sum[rt<<|])+lazy[rt];
} void update(ll L,ll R,ll c,ll l,ll r,ll rt){
if(L <= l&&R >= r){
sum[rt] += c;
lazy[rt] += c;
return ;
}
mid;
if(L <= m) update(L,R,c,lson);
if(R > m) update(L,R,c,rson);
pushup(rt);
} int main()
{
ios::sync_with_stdio();
cin.tie(); cout.tie();
ll n,w,h,a,b,c;
while(cin>>n>>w>>h){
ll len = ;
while(n--){
cin>>a>>b>>c;
x[len] = a;
t[len++] = seg(a,a+w,b,c);
x[len] = a+w;
t[len++] = seg(a,a+w,b+h,-c);
}
sort(x,x+len);
sort(t,t+len);
ll k = unique(x,x+len) - x;
memset(sum,,sizeof(sum));
memset(lazy,,sizeof(lazy));
ll ans = ;
for(ll i = ;i < len;i ++){
ll l = lower_bound(x,x+k,t[i].l) - x; //左开右闭区间
ll r = lower_bound(x,x+k,t[i].r) - x-;
//cout<<l<<" "<<r<<endl;
if(l <= r) update(l,r,t[i].s,,k-,);
ans = max(ans,sum[]);
}
cout<<ans<<endl;
}
return ;
}
题目来源: Poj
基准时间限制:2 秒 空间限制:131072 KB 分值: 160 难度:6级算法题
 收藏
 关注
整点上有N颗星星,每颗星星有一个亮度。用一个平行于x轴和y轴,宽为W高为H的方框去套星星。套住的所有星星的亮度之和为S(包括边框上的星星),求S的最大值。

 
Input
第1行:共3个数N, W, H,中间用空格分割,N为星星的数量,W为方框的宽度,H为方框的高度。(2 <= N <= 50000, 1 <= W, H <= 10^9)
第2 - N + 1行:每行3个数,X, Y, L,中间用空格分隔,分别表示星星的横坐标X,纵坐标Y,以及星星的亮度L。(1 <= X, Y <= 10^9,1 <= L <= 10000)
Output
输出方框能够套住的最大亮度和S。
Input示例
6 3 3
1 1 2
2 2 3
3 3 4
4 4 3
5 5 2
6 6 1
Output示例
12
思路:
与上题基本一样,只是这道题包括边界上的星星,在上题的基础上修改下边界的判断就好了。
实现代码:
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll __int64
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mid ll m = (l + r) >> 1
const ll M = 1e5+;
ll sum[M<<],lazy[M<<],x[M];
struct seg{
ll l,r,h,s;
seg(){}
seg(ll a,ll b,ll c,ll d):l(a),r(b),h(c),s(d){}
bool operator < (const seg &cmp) const { //因为是边界上也算,所以碰到一些点上边和一些点下边重合的情况优先计算其他点的下边(为正的)再算上边(为负的)。
if(h == cmp.h) return s > cmp.s;
return h < cmp.h;
}
}t[M]; void pushup(ll rt){
sum[rt] = max(sum[rt<<] ,sum[rt<<|])+lazy[rt];
} void update(ll L,ll R,ll c,ll l,ll r,ll rt){
if(L <= l&&R >= r){
sum[rt] += c;
lazy[rt] += c;
return ;
}
mid;
if(L <= m) update(L,R,c,lson);
if(R > m) update(L,R,c,rson);
pushup(rt);
} int main()
{
ios::sync_with_stdio();
cin.tie(); cout.tie();
ll n,w,h,a,b,c;
while(cin>>n>>w>>h){
ll len = ;
while(n--){
cin>>a>>b>>c;
x[len] = a;
t[len++] = seg(a,a+w,b,c);
x[len] = a+w;
t[len++] = seg(a,a+w,b+h,-c);
}
sort(x,x+len);
sort(t,t+len);
ll k = unique(x,x+len) - x;
memset(sum,,sizeof(sum));
memset(lazy,,sizeof(lazy));
ll ans = ;
for(ll i = ;i < len;i ++){
ll l = lower_bound(x,x+k,t[i].l) - x; //左开右开区间
ll r = lower_bound(x,x+k,t[i].r) - x;
//cout<<l<<" "<<r<<endl;
if(l <= r) update(l,r,t[i].s,,k-,);
ans = max(ans,sum[]);
}
cout<<ans<<endl;
}
return ;
}

poj 2482 Stars in Your Window + 51Nod1208(扫描线+离散化+线段树)的更多相关文章

  1. POJ 2482 Stars in Your Window(扫描线+线段树)

    [题目链接] http://poj.org/problem?id=2482 [题目大意] 给出一些点的二维坐标和权值,求用一个长H,宽W的矩形能框住的最大权值之和, 在矩形边缘的点不计算在内 [题解] ...

  2. poj 2482 Stars in Your Window(扫描线)

    id=2482" target="_blank" style="">题目链接:poj 2482 Stars in Your Window 题目大 ...

  3. POJ 2482 Stars in Your Window(线段树)

    POJ 2482 Stars in Your Window 题目链接 题意:给定一些星星,每一个星星都有一个亮度.如今要用w * h的矩形去框星星,问最大能框的亮度是多少 思路:转化为扫描线的问题,每 ...

  4. POJ 2482 Stars in Your Window 线段树扫描线

    Stars in Your Window   Description Fleeting time does not blur my memory of you. Can it really be 4 ...

  5. POJ 2482 Stars in Your Window (线段树区间合并+扫描线)

    这题开始一直被矩形框束缚了,想法一直都是枚举线,但是这样枚举都需要O(n^2)...但是看了别人的思路,感觉这题思想真心很好(PS:开头好浪漫的描述啊,可惜并没有什么用)  题意就是在平面上给你一些星 ...

  6. (中等) POJ 2482 Stars in Your Window,静态二叉树。

    Description Here comes the problem: Assume the sky is a flat plane. All the stars lie on it with a l ...

  7. POJ 2482 Stars in Your Window 离散化+扫描法 线段树应用

    遇见poj上最浪漫的题目..题目里图片以上几百词为一篇模板级英文情书.这情感和细腻的文笔深深地打动了我..不会写情书的童鞋速度进来学习.传送门 题意:坐标系内有n个星星,每个星星都有一个亮度c (1& ...

  8. POJ 2482 Stars in Your Window

    线段树+离散化+扫描线 AC之后,又认真读了一遍题目,好文章. #include<cstdio> #include<map> #include<algorithm> ...

  9. POJ 2482 Stars in Your Window (线段树+扫描线+区间最值,思路太妙了)

    该题和 黑书 P102 采矿 类似 参考链接:http://blog.csdn.net/shiqi_614/article/details/7819232http://blog.csdn.net/ts ...

随机推荐

  1. (转)postfix疯狂外发垃圾邮件之分析与解决

    从进程中看到,好像是postfix有问题.我这postfix主要是用来给程序发达邮件用的,如报警,程序外发邮件等.平时postfix进程不会像现在这样异常,这在postf主进程CPU占用高,其它的相关 ...

  2. ceph 池管理

    存储池的概念:比如有10个1T的硬盘,作为一个集群,那就可以在这个集群里划分几个池,给不同的组件使用 问题描述: 删除pool的时候提示下面的错误: ceph osd pool delete test ...

  3. iOS9中http不能使用的解决

    用xcode7写程序的时候发现webview不能显示http的链接网页,发现原来是由于ios9的一个新特性,iOS9引入了新特性App Transport Security (ATS),新特性要求Ap ...

  4. [Usaco2012 Dec]First! BZOJ3012

    分析: 其实我们可以很容易的想到,如果一个串是另一个串的子串,那么必定长的那个串不可能是字典序最小的串.其次,如果一个串为了使他成为字典序最小的串儿出现了矛盾的情况,那么也不可能是字典序最小的串.那么 ...

  5. 20155204《网络对抗》Exp 6 信息搜集与漏洞扫描

    20155204<网络对抗>Exp 6 信息搜集与漏洞扫描 一.实验后回答问题 1.哪些组织负责DNS,IP的管理. 互联网名称与数字地址分配机构,简称ICANN机构,决定了域名和IP地址 ...

  6. 20155210 Exp7 网络欺诈防范

    Exp7 网络欺诈防范 SET工具建立冒名网站 首先利用lsof -i:80或者netstat -tupln |grep 80查询80端口的使用情况(我的电脑80端口没有被占用,如果被占用,则用kil ...

  7. vue.js 2.0实现的简单分页

    <!DOCTYPE html> <html> <head> <meta charset="UTF-8" /> <title&g ...

  8. 【LG1368】工艺

    [LG1368]工艺 题面 洛谷 题解 好套路的一道题... 我们倍长这个字符串,然后我们要查询的串就为这个倍长过后串的长度\(n\)一个子串,要求字典序最小 然后就可以非常愉快地后缀排序了 后缀的话 ...

  9. SSRS配置1:凭证和邮件

    SSRS是微软的高度集成的报表服务,通过报表服务配置管理器(Reporting Service Configuration Manager,简称RSCM),能够轻松实现报表的配置和管理,本文主要分享凭 ...

  10. 11、Dockerfile实战-Tomcat

    一.编写Dockerfile 具体步骤这里不再细说,直接看Dockerfile文件: FROM centos:7 MAINTAINER QUNXUE ENV VERSION=8.0.46 RUN yu ...