bzoj1571

guoshiyuan484

于 2018-02-13 11:02:21 发布

阅读量187

点赞数

分类专栏： usaco专题

本文链接：https://blog.csdn.net/guoshiyuan484/article/details/79320592

版权

usaco专题专栏收录该内容

2 篇文章 0 订阅

订阅专栏

此题就是用一个动态规划

先考虑爆搜，很明显有2^n选择你可以选择上课还是不上哪些课

每个情况都求出来然后找最大值就好了，然后很明显这样超时

所以用一个动态规划记录一下就好了

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int value[120]
struct lesson
{
	int s, t, able;
	int allamount;
};
lesson l[1000];
int T, S, N;
bool com(lesson a, lesson b)
{
	return a.s < b.s;
}
int main()
{
	scanf("%d%d%d", &T, &S, &N);
	l[0].s = l[0].t = 0;
	l[0].able = 1; l[0].allamount = 0;
	for (int i = 1; i <=S; i++)
	{
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		l[i].s = a + 1; l[i].t = l[i].s + b - 1;
		l[i].able = c;
	}
	sort(l, l + S+ 1, com);
	for (int i = 0; i < 120; i++)
		value[i] = 1000000000;
	for (int i = 0; i < N; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		value[a] = min(value[a], b);
	}
	for (int i = 1; i < 101; i++)
	{
		value[i] = min(value[i], value[i - 1]);
	}
	for (int i = 1; i <= S; i++)
	{
		for (int j = 0; j <= i - 1; j++)
		{
			if (l[j].t<l[i].s&&l[j].able <= l[i].able)
			l[i].allamount = max((l[i].s - l[j].t - 1) / value[l[j].able] + l[j].allamount, l[i].allamount);
		}
	}
	int ans = 0;
	for (int i = 0; i <= S; i++)
	{
		ans = max(ans, (T - l[i].t) / value[l[i].able] + l[i].allamount);
	}
	printf("%d\n", ans);
}