【20.19%】【codeforces 629D】Babaei and Birthday Cake
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
As you know, every birthday party has a cake! This time, Babaei is going to prepare the very special birthday party’s cake.
Simple cake is a cylinder of some radius and height. The volume of the simple cake is equal to the volume of corresponding cylinder. Babaei has n simple cakes and he is going to make a special cake placing some cylinders on each other.
However, there are some additional culinary restrictions. The cakes are numbered in such a way that the cake number i can be placed only on the table or on some cake number j where j < i. Moreover, in order to impress friends Babaei will put the cake i on top of the cake j only if the volume of the cake i is strictly greater than the volume of the cake j.
Babaei wants to prepare a birthday cake that has a maximum possible total volume. Help him find this value.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of simple cakes Babaei has.
Each of the following n lines contains two integers ri and hi (1 ≤ ri, hi ≤ 10 000), giving the radius and height of the i-th cake.
Output
Print the maximum volume of the cake that Babaei can make. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let’s assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .
Examples
input
2
100 30
40 10
output
942477.796077000
input
4
1 1
9 7
1 4
10 7
output
3983.539484752
Note
In first sample, the optimal way is to choose the cake number 1.
In second sample, the way to get the maximum volume is to use cakes with indices 1, 2 and 4.
【题解】
DP
设f[i]表示以i号蛋糕作为最上面一层能获取到的最大体积;
f[i] = max(f[j])+v[i];(1<=j<=i-1);
其中j要满足v[j]小于v[i]
(不能等于!)
这样做肯定是O(N^2),而N最大10W。。
考虑到我们需要1..i-1里面小于v[i]且f最大的f值;
则我们考虑用线段树来维护;
这里需要先把数据离散化一下(离散化的标准以r^2*h就好,pi作为一个常数不用乘进去);
然后用lower_bound什么的获取每个数据新的key值;
key值小的对应的数据就小;
则我们顺序处理保证了i小于j;
然后在1..key[i]-1里面找f最大的值;
这里另外一层含义就是说把体积当下标来使用;
f[体积]表示以这个体积作为最上面一层的蛋糕的最大体积;
这里线段树就维护了f[1..当前体积-1]里的最大值,并快速检索;
当然在计算体积的时候要把pi乘进去;
当然你也可以选择加完之后输出答案的时候再乘;
whatever.
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#define lson L,m,rt<<1
#define rson m+1,R,rt<<1|1
#define LL long long
using namespace std;
const int MAXN = 2e5;
const int dx[5] = {0,1,-1,0,0};
const int dy[5] = {0,0,0,-1,1};
const double pi = acos(-1.0);
int n,key[MAXN];
LL v[MAXN],r[MAXN],h[MAXN];
double maxsum[MAXN<<2];
vector <LL> a;
void input_LL(LL &r)
{
r = 0;
char t = getchar();
while (!isdigit(t)) t = getchar();
LL sign = 1;
if (t == '-')sign = -1;
while (!isdigit(t)) t = getchar();
while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
r = r*sign;
}
void input_int(int &r)
{
r = 0;
char t = getchar();
while (!isdigit(t)) t = getchar();
int sign = 1;
if (t == '-')sign = -1;
while (!isdigit(t)) t = getchar();
while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
r = r*sign;
}
void build(int L,int R,int rt)
{
maxsum[rt] = 0;
int m = (L+R)>>1;
if (L==R)
return;
build(lson);
build(rson);
}
double query(int l,int r,int L,int R,int rt)
{
if (l>r)
return 0;
if (l <= L && R <= r)
return maxsum[rt];
int m = (L+R)>>1;
double res = 0;
if (l <= m)
res = max(res,query(l,r,lson));
if (m < r)
res = max(res,query(l,r,rson));
return res;
}
void up_data(int pos,double ke,int L,int R,int rt)
{
if (L==R)
{
maxsum[rt] = max(maxsum[rt],ke);
return;
}
int m = (L+R)>>1;
if (pos<=m)
up_data(pos,ke,lson);
else
up_data(pos,ke,rson);
maxsum[rt] = max(maxsum[rt<<1],maxsum[rt<<1|1]);
}
int main()
{
//freopen("F:\\rush.txt", "r", stdin);
input_int(n);
for (int i = 1;i <= n;i++)
{
scanf("%d%d",&r[i],&h[i]);
v[i] =r[i]*r[i]*h[i];
a.push_back(v[i]);
}
sort(a.begin(),a.end());
for (int i = 1;i <= n;i++)
key[i] = lower_bound(a.begin(),a.end(),v[i])-a.begin()+1;
build(1,n,1);
for (int i = 1;i <= n;i++)
{
double vo = pi*r[i]*r[i]*h[i];
vo += query(1,key[i]-1,1,n,1);
up_data(key[i],vo,1,n,1);
}
printf("%.10lf\n",query(1,n,1,n,1));
return 0;
}
【20.19%】【codeforces 629D】Babaei and Birthday Cake的更多相关文章
- codeforces 629D D. Babaei and Birthday Cake (线段树+dp)
D. Babaei and Birthday Cake time limit per test 2 seconds memory limit per test 256 megabytes input ...
- 【 BowWow and the Timetable CodeForces - 1204A 】【思维】
题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...
- 【19.77%】【codeforces 570D】Tree Requests
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【20.23%】【codeforces 740A】Alyona and copybooks
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【19.46%】【codeforces 551B】ZgukistringZ
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【44.19%】【codeforces 608D】Zuma
time limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard o ...
- 【20.51%】【codeforces 610D】Vika and Segments
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【77.78%】【codeforces 625C】K-special Tables
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
- 【codeforces 515C】Drazil and Factorial
[题目链接]:http://codeforces.com/contest/515/problem/C [题意] 定义f(n)=n这个数各个位置上的数的阶乘的乘积; 给你a; 让你另外求一个不含0和1的 ...
随机推荐
- 为SSO 5.5恢复忘记的administrator@vsphere.local密码
转自:http://blog.itpub.net/27042095/viewspace-1179938/ 1. cd \Program Files\VMware\Infrastructure\VMwa ...
- cocos2d-x 一些实用的函数
1. 自己主动释放粒子内存的函数 setAutoRemoveOnFinish(bool var) 2. 解决使用tiled出现像素线的问题在代码中搜索"CC_FIX_ARTIFA ...
- 内存问题检查利器——Purify
内存问题检查利器——Purify 一. 引言 我们都知道软件的测试(在以产品为主的软件公司中叫做QA—Quality Assessment)占了整个软件工程的30% -50%,但有 ...
- POJ 1275 Cashier Employment 挺难的差分约束题
http://poj.org/problem?id=1275 题目大意: 一商店二十四小时营业,但每个时间段需求的雇员数不同(已知,设为R[i]),现有n个人申请这份工作,其可以从固定时间t连续工作八 ...
- TensorFlow on Windows: “Couldn't open CUDA library cudnn64_5.dll”
TensorFlow on Windows: "Couldn't open CUDA library cudnn64_5.dll" 在 windows 下,使用 import te ...
- EntityFrameworkCore 中的 Attach 方法
Attach 的坑 Model Filed Database Value Console Value User Phone +123000000000 +12333333333 User Email ...
- C++中string类的操作函数。
相信使用过MFC编程的朋友对CString这个类的印象应该非常深刻吧?的确,MFC中的CString类使用起来真的非常的方便好用.但是如果离开了MFC框架,还有没有这样使用起来非常方便的类呢?答案是肯 ...
- Ditto —— windows 剪贴板增强小工具(复制粘贴多条记录)
Windows 虽然不断在升级,但系统自带的剪贴板功能却仍然弱爆了 (只能保留一条记录). Ditto 下载地址:http://sourceforge.net/projects/ditto-cp/fi ...
- Android学习笔记:Home Screen Widgets(2):关于Widget
通过widget定义,我们在widget列表中看到了我们的TestWidget.当我们拖拽widget到主页时,假设在appwidet-provider中定义了android:configure的ja ...
- Android 为开发者准备的最佳 Android 函数库(2016 年版)
本文是翻译自 CloudRAIL 的官方博客(https://cloudrail.com/best-android-libraries-for-developers/),本文中分享的 Android ...