Codeforces Round #436 (Div. 2) E. Fire（01背包+输出路径）

Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take tiseconds to save i-th item. In addition, for each item, he estimated the value of di — the moment after which the item i will be completely burned and will no longer be valuable for him at all. In particular, if ti ≥ di, then i-th item cannot be saved.

Given the values pi for each of the items, find a set of items that Polycarp can save such that the total value of this items is maximum possible. Polycarp saves the items one after another. For example, if he takes item a first, and then item b, then the item a will be saved in taseconds, and the item b — in ta + tb seconds after fire started.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of items in Polycarp's house.

Each of the following n lines contains three integers ti, di, pi (1 ≤ ti ≤ 20, 1 ≤ di ≤ 2 000, 1 ≤ pi ≤ 20) — the time needed to save the itemi, the time after which the item i will burn completely and the value of item i.

Output

In the first line print the maximum possible total value of the set of saved items. In the second line print one integer m — the number of items in the desired set. In the third line print m distinct integers — numbers of the saved items in the order Polycarp saves them. Items are 1-indexed in the same order in which they appear in the input. If there are several answers, print any of them.

Examples

input

3
3 7 4
2 6 5
3 7 6

output

11
2
2 3 

input

2
5 6 1
3 3 5

output

1
1
1 

题意：发生了火灾，现在有n个物品需要抢救。每个物品有抢救的时间和最晚时刻，还有价值。

让求最大能抢救出来物品的价值，还有物品的个数，还要输出这些物品。

我们可以用dp[i][j]表示取到第i个物品以时刻j为结束时间的最大价值，然后就会发现这其实就是一个01背包。

因为要输出路径，所以用一个pre数组取存一下什么状态是存在的，然后递归输出。

还有就是要注意一下最后求最大价值的时候ans要初始化为小于0的数，如果初始化为0的话，就找不到一个起始点来递归，就会RE。

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;


struct node
{
    int t,d,v,i;

}a[110];

bool cmp(node a,node b)
{
    if(a.d != b.d)
        return a.d < b.d;
    return a.v < b.v;
}

int dp[110][2200];
int pre[110][2200];


void print(int i,int j,int cnt)
{
    if(i == 0)
    {
        printf("%d\n",cnt);
        return;
    }
    if(pre[i][j] == 0)
    {
        print(i-1,j,cnt);
    }
    else
    {
        print(i-1,j-a[i].t,cnt+1);
        printf("%d ",a[i].i);
    }
}
int main(void)
{
    int n,i,j;
    while(scanf("%d",&n)==1)
    {
        for(i=1;i<=n;i++)
        {
            scanf("%d%d%d",&a[i].t,&a[i].d,&a[i].v);
            a[i].i = i;
        }
        sort(a+1,a+n+1,cmp);
        memset(pre,0,sizeof(pre));
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
        {
            for(j=0;j<=2000;j++)
            {
                dp[i][j] = dp[i-1][j];
                if(j >= a[i].t && j <= a[i].d - 1)
                {
                    if(dp[i][j] < dp[i-1][j-a[i].t] + a[i].v)
                    {
                        dp[i][j] = dp[i-1][j-a[i].t] + a[i].v;
                        pre[i][j] = 1;
                    }
                }
            }
        }
        int ans = -1;
        int c;
        for(i=0;i<=2000;i++)
        {
            if(dp[n][i] > ans)
            {
                ans = dp[n][i];
                c = i;
            }
        }
        cout << ans << endl;
        print(n,c,0);
        cout << endl;
    }

    return 0;
}