employment专题

hdu 1158 (dp)Employment Planning

做的时候,头有点昏。糊里糊涂就ac了。。。 #include <iostream>using namespace std;int m1[100000],m2[100000];int main(){int m;int p[13],a,b,c;while(scanf("%d",&m)==1&&m){scanf("%d %d %d",&a,&b,&c);int mp=0;for(in

poj 1275 Cashier Employment

题目链接:http://poj.org/problem?id=1275 Description A supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired you to he

HDU 1529 POJ 1275 Cashier Employment

一家每天24小时营业的店,在不同小时需不同数量的店员,现有n(≤1000)个人来应聘,第i个人会从 sti st_i开始连续工作8小时,求最少雇佣人数。