ZOJ3381 线段树+DP

Osaisen Choudai!

---

Time Limit: 3 Seconds      Memory Limit: 65536 KB

---

A saisenbako ( 賽銭箱, offertory, or religious collection box) is situated in front of the hall of Hakurei Shrine. Hakurei Reimu ( 博麗霊夢), the miko of Hakurei Shrine, may ask the friends who are visting her to throw some saisen ( 賽銭, offerings, or coins) into it. Reimu wants as much saisen as possible. Howerver, she cannot ask for saisen too frequently, because this will make her friends refuse to offer any more. On the other hand, if she doesn't ask for saisen for a very long period, her friends will become not be willing to offer any more. Generally, at the i -th day, if she asks for saisen , then she will get s_i saisen , what's more, she cannot ask again for x_i days (including the i -th day), and she should ask again in y_i days (including the i -th day).

Given s_i , x_i and y_i for n days, how much saisen can Reimu get at most in these days if she asks saisen at the first day?

Input

The are multiple cases. Each case begins with a line of integer 0 < n < 50000, then n lines, each contains 3 positive integers: s_i , and x_i < y_i . Process to the end of file.

Output

For each test cases, output an integer, the maximun amount of saisen Reimu can get, in a seperate line. It's guaranteed that the answer always fit into a 32-bit signed integer.

Sample Input

3

1 1 2

2 2 3

3 3 4

3

1 1 3

2 2 4

3 3 5

4

10 3 10

7 1 7

5 2 5

1 1 2

5

1 1 9

10 3 10

7 1 7

5 2 5

1 1 2

Sample Output

3

4

11

13

 

 

线段树 +DP.

从后往前推 , 假设是第 i 天能获得 dp[i], 转移方程为 :

dp[i]=max(dp[i+x[i]]..dp[i+y[i]-1])+s[i];

这样推的话 ,dp[1] 就是题目要求的最大值 .

 

代码如下 :

 

#include<stdio.h> #include<string.h> #include<algorithm> using std::sort; #define MAXN 50005 inline int max(int a,int b) { return a>b?a:b; } struct ST { int l,r,max; }st[MAXN*5]; int s[MAXN],d[MAXN],v[MAXN],tempx[3*MAXN],x[3*MAXN]; void build(int l,int r,int n) { st[n].l=l; st[n].r=r; st[n].max=0; if (l==r) return; int mid=(l+r)/2; build(l,mid,2*n); build(mid+1,r,2*n+1); } int count(int l,int r,int n) { if (x[st[n].l]==l&&x[st[n].r]==r) return st[n].max; int mid=(st[n].l+st[n].r)/2; if (r<=x[st[2*n].r]) return count(l,r,2*n); else if (l>=x[st[2*n+1].l]) return count(l,r,2*n+1); else { return max(count(l,x[mid],2*n),count(x[mid+1],r,2*n+1)); } } void update(int l,int r,int v,int n) { if (v>st[n].max) st[n].max=v; if (l==x[st[n].l]&&r==x[st[n].r]) return; int mid=(st[n].l+st[n].r)/2; if (r<=x[st[2*n].r]) return update(l,r,v,2*n); else if (l>=x[st[2*n+1].l]) return update(l,r,v,2*n+1); } int main() { // freopen("a.txt","r",stdin); int n,t,i,tt,temp; while (scanf("%d",&n)!=EOF) { for (i=1;i<=n;++i) { tempx[i]=i; } t=n; for (i=1;i<=n;++i) { scanf("%d%d%d",&v[i],&s[i],&d[i]); s[i]+=i;d[i]+=i-1; tempx[++t]=s[i];tempx[++t]=d[i]; } sort(tempx+1,tempx+t+1); tt=0; x[tt++]=-1; for (i=1;i<=t;++i) { if (tempx[i]!=x[tt-1]) x[tt++]=tempx[i]; else continue; } tt--; build(1,tt,1); for (i=n;i>=1;--i) { if (s[i]<=n) { temp=count(s[i],d[i]<=n?d[i]:n,1); if (i==1) break; update(i,i,v[i]+temp,1); } else update(i,i,v[i],1); } printf("%d/n",temp+v[1]); } return 0; }