Home  >  Article  >  Web Front-end  >  Codeforces Beta Round #4 (Div. 2 Only) B. Before an Exam_html/css_WEB-ITnose

Codeforces Beta Round #4 (Div. 2 Only) B. Before an Exam_html/css_WEB-ITnose

WBOY
WBOYOriginal
2016-06-24 11:53:111111browse

继续刷水题,不能再错了!!


题目大意:

要求在n天内学习t小时,给出每一天可以学习的最小时间和最大时间。问能不能实现,若可以输出时间表。



解题思路:

水题一个,保证在区间范围内的情况下直接贪心。



下面是代码:

#include #include #include #include #include #include #include #include #include #include #include #include #define eps 1e-10#define pi acos(-1.0)#define inf 107374182#define inf64 1152921504606846976#define lc l,m,tr 0 ? (x) : -(x))#define clear1(A, X, SIZE) memset(A, X, sizeof(A[0]) * (min(SIZE,sizeof(A))))#define clearall(A, X) memset(A, X, sizeof(A))#define memcopy1(A , X, SIZE) memcpy(A , X ,sizeof(X[0])*(SIZE))#define memcopyall(A, X) memcpy(A , X ,sizeof(X))#define max( x, y )  ( ((x) > (y)) ? (x) : (y) )#define min( x, y )  ( ((x) t)    {        puts("NO");    }    else    {        puts("YES");        t-=downlim;        for(int i=0;i=da[i].max1-da[i].min1)            {                printf("%d ",da[i].max1);                t-=da[i].max1-da[i].min1;            }            else if(t==0)            {                printf("%d ",da[i].min1);            }            else if(t  

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn