思路:令dp[i][j]为做了i天用了j时间,然后随便转移一下就可以了
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100000
#define LL long long
int cas=1,T;
int dp[31][250];
int p[31][250];
int l[31],r[31];
void solve(int x,int y)
{
if (x!=1)
solve(x-1,p[x][y]);
printf("%d ",y-p[x][y]);
}
int main()
{
int d,sumtime;
while (scanf("%d%d",&d,&sumtime)!=EOF)
{
int maxt=0;
int mint=0;
for (int i = 1;i<=d;i++)
{
scanf("%d%d",&l[i],&r[i]);
maxt+=r[i];
mint+=l[i];
}
if (maxt<sumtime || mint>sumtime)
{
puts("NO");
continue;
}
dp[0][0]=1;
for (int i = 1;i<=d;i++)
{
for (int j = 0;j<=240;j++)
{
if (dp[i-1][j])
for (int k = l[i];k<=r[i];k++)
{
dp[i][j+k]=1;
p[i][j+k]=j;
}
}
}
if (dp[d][sumtime])
{
puts("YES");
solve(d,sumtime);
}
else
puts("NO");
}
//freopen("in","r",stdin);
//scanf("%d",&T);
//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
return 0;
}