• 博客访问： 490649
• 博文数量： 137
• 博客积分： 3874
• 博客等级： 中校
• 技术积分： 1475
• 用 户 组： 普通用户
• 注册时间： 2010-07-05 10:50

2011年（37）

2010年（100）

2010-10-20 09:52:03

－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－
Fence
 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 1347 Accepted: 367

Description

A team of k (1 <= K <= 100) workers should paint a fence which contains N (1 <= N <= 16 000) planks numbered from 1 to N from left to right. Each worker i (1 <= i <= K) should sit in front of the plank Si and he may paint only a compact interval (this means that the planks from the interval should be consecutive). This interval should contain the Si plank. Also a worker should not paint more than Li planks and for each painted plank he should receive Pi \$ (1 <= Pi <= 10 000). A plank should be painted by no more than one worker. All the numbers Si should be distinct.

Being the team's leader you want to determine for each worker the interval that he should paint, knowing that the total income should be maximal. The total income represents the sum of the workers personal income.

Write a program that determines the total maximal income obtained by the K workers.

Input

The input contains:
Input

N K
L1 P1 S1
L2 P2 S2
...
LK PK SK

Semnification

N -the number of the planks; K ? the number of the workers
Li -the maximal number of planks that can be painted by worker i
Pi -the sum received by worker i for a painted plank
Si -the plank in front of which sits the worker i

Output

The output contains a single integer, the total maximal income.

Sample Input

```8 4
3 2 2
3 2 3
3 3 5
1 1 7```

Sample Output

`17`

Hint

Explanation of the sample:

the worker 1 paints the interval [1, 2];

the worker 2 paints the interval [3, 4];

the worker 3 paints the interval [5, 7];

the worker 4 does not paint any plank

F[I]:=Max{F[J]+Len*Cost}

#include
#include
#include
using namespace std;
long N,K;
long f[16100];
struct Painter
{
long length;
long sit;
long price;
bool operator < (const struct Painter &a) const
{
return sit       }
}p[120];
int main()
{
long ibegin,iend,i,j,ans;
while(EOF!=scanf("%ld%ld",&N,&K))
{
ans=0;
memset(f,0,sizeof(f));
for(i=1;i<=K;i++)
scanf("%ld%ld%ld",&p[i].length,&p[i].price,&p[i].sit);
sort(p+1,p+1+K);
for(i=1;i<=K;i++)
{
ibegin=p[i].sit;
for(iend=p[i].sit+p[i].length-1;iend>=p[i].sit;iend--)
{
if(iend<=N&&iend-p[i].length<=0) f[iend]=max(f[iend],iend*p[i].price);
else if(iend<=N) f[iend]=max(f[iend],f[ibegin-1]+(iend-ibegin+1)*p[i].price);
if(iend-p[i].length>0&&p[i].price*(p[i].length-(iend-ibegin))>f[ibegin-1]-f[ibegin-1-(p[i].length-(iend-ibegin))])
ibegin=iend-p[i].length;
}
for(iend=p[i].sit+p[i].length;iend<=N;iend++)
f[iend]=max(f[iend],f[p[i].sit+p[i].length-1]);
}
ans=max(ans,f[N]);
printf("%ld\n",ans);
}
return 0;
}

0

chinaunix网友2010-10-20 16:37:07