Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu Submit Status Practice ZOJ 3607 Description Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th custome…

Lazier Salesgirl Time Limit: 2 Seconds Memory Limit: 65536 KB Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer a piece of bread for price pi. But she is so lazy that…

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3607 Lazier Salesgirl Time Limit: 2 Seconds      Memory Limit: 65536 KB Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell th…

Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer a piece of bread for price pi. But she is so lazy that she will fall asleep if no customer comes to buy bread for mor…

Description Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer a piece of bread for price pi. But she is so lazy that she will fall asleep if no customer comes to buy b…

这个题比上个题简单得多,也是超过W时间会睡着,睡着就再也不会卖了,顾客按时间顺序来的,但是可能有顾客同时到(同时到如果醒着就全卖了),并且每个人只买一块面包,也是求最大的W,使得卖出面包的平均价格最高. 同理最大的W一定是某两个相邻人的时间差.因为睡着了就不会醒了,所以枚举的时间差必须越来越大.如果某个时间差比前面枚举过的小也没啥意义(因为在前面就会睡着).因此,直接枚举第i个人和第(i-1)个人的那个时间差(在此之前的时间差都比这个小),然后从第(i+1)个人开始连续一段人的时间差都不超过这个…

Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer a piece of bread for price pi. But she is so lazy that she will fall asleep if no customer comes to buy bread for mor…

题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3607 题意:一个卖面包的小姑娘,给第i个来买面包的人的价格是pi, 每个人的时间是ti, 问用最小的时间间隔 求最大的平均值. 刚开始没有 考虑,后一个的时间间隔要大于之前的最大的时间间隔 才行... #include <iostream> #include <cstdio> #include <cstring> #include <…

The 9th Zhejiang Provincial Collegiate Programming Contest A    Taxi Fare    25.57% (166/649)     (水题)    计算两种计程车计费方式的差值, 注意四舍五入    B    Unrequited Love    14.00% (7/50)    水题) C    Count the Trees    9.87% (8/81)   (二叉树)    卡特兰数应用的问题     D    Draw S…

http://blog.csdn.net/ffq5050139/article/details/7832991 http://blog.watashi.ws/1944/the-8th-zjpcpc/ http://blog.csdn.net/crescent__moon/article/details/16801097 #include<cstdio> #include<cstring> ; double t[Max],p[Max],lev[Max]; double max(dou…