目录:
题目:
分析:
我们设
f[i][j]
f
[
i
]
[
j
]
表示安排前i个工匠粉刷前j块木板,工匠获得的最大报酬,那么转移是:
f[i][j]=max{f[i−1][k]+pi∗(j−k)}
f
[
i
]
[
j
]
=
m
a
x
{
f
[
i
−
1
]
[
k
]
+
p
i
∗
(
j
−
k
)
}
观察一下,我们可以通过单调队列进行优化,将时间复杂度降到
O(mn)
O
(
m
n
)
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#define LL long long
#define h happy
#define XJQ 1000000007
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int max(int x,int y)
{
return x>y? x:y;
}
deque<int> q;
struct carpenter{
int s,l,p;
}c[101];
int f[101][16001];
bool cmp(carpenter x,carpenter y)
{
return x.s<y.s;
}
int main()
{
int n=read(),m=read();
for(int i=1;i<=m;i++)
c[i].l=read(),c[i].p=read(),c[i].s=read();
sort(c+1,c+1+m,cmp);
for(int i=1;i<=m;i++)
{
while(q.size()) q.pop_back();
for(int j=max(c[i].s-c[i].l,0);j<c[i].s;j++)
{
while(q.size()&&f[i-1][q.back()]-c[i].p*q.back()<=f[i-1][j]-j*c[i].p)
q.pop_back();
q.push_back(j);
}
for(int j=1;j<=n;j++)
{
f[i][j]=max(f[i-1][j],f[i][j-1]);
if(j>=c[i].s)
{
while(q.size()&&q.front()<j-c[i].l) q.pop_front();
if(q.size()) f[i][j]=max(f[i][j],f[i-1][q.front()]-c[i].p*q.front()+c[i].p*j);
}
}
}
cout<<f[m][n];
return 0;
}