CodeForces 35D Animals

G - Animals

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 35D

Description

input

input.txt

output

output.txt

Once upon a time DravDe, an outstanding person famous for his professional achievements (as you must remember, he works in a warehouse storing Ogudar-Olok, a magical but non-alcoholic drink) came home after a hard day. That day he had to drink 9875 boxes of the drink and, having come home, he went to bed at once.

DravDe dreamt about managing a successful farm. He dreamt that every day one animal came to him and asked him to let it settle there. However, DravDe, being unimaginably kind, could send the animal away and it went, rejected. There were exactly n days in DravDe’s dream and the animal that came on the i-th day, ate exactly c_i tons of food daily starting from day i. But if one day the animal could not get the food it needed, it got really sad. At the very beginning of the dream there were exactly X tons of food on the farm.

DravDe woke up terrified...

When he retold the dream to you, he couldn’t remember how many animals were on the farm by the end of the n-th day any more, but he did remember that nobody got sad (as it was a happy farm) and that there was the maximum possible amount of the animals. That’s the number he wants you to find out.

It should be noticed that the animals arrived in the morning and DravDe only started to feed them in the afternoon, so that if an animal willing to join them is rejected, it can’t eat any farm food. But if the animal does join the farm, it eats daily from that day to the n-th.

Input

The first input line contains integers n and X (1 ≤ n ≤ 100, 1 ≤ X ≤ 10⁴) — amount of days in DravDe’s dream and the total amount of food (in tons) that was there initially. The second line contains integers c_i (1 ≤ c_i ≤ 300). Numbers in the second line are divided by a space.

Output

Output the only number — the maximum possible amount of animals on the farm by the end of the n-th day given that the food was enough for everybody.

Sample Input

Input

3 4
1 1 1

Output

2

Input

3 6
1 1 1

Output

3

Hint

Note to the first example: DravDe leaves the second and the third animal on the farm. The second animal will eat one ton of food on the second day and one ton on the third day. The third animal will eat one ton of food on the third day.

#include<iostream>
#include<cstdio>
#include<fstream>
using namespace std;

int ani[];
int dp[];
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n,x;
    cin>>n>>x;
    //scanf("%d%d",&n,&x);
    for(int i=; i<=n; i++)
    {
        scanf("%d",&ani[i]);
        ani[i]*=(n-i+);
    }
    for(int i=;i<=n;i++)
        for(int j=x;j>=ani[i];j--)
            dp[j]=max(dp[j],dp[j-ani[i]]+);
    //printf("%d\n",dp[x]);
    cout<<dp[x]<<endl;
    return ;
}

这道题可以dp，也可以贪心。贪心的想法比较简单。按照消耗从小到大排序，从小的开始拿就可以了。

dp的思想是：

dp[x]=max(dp[x],dp[x-ani[i]+1];

dp[x]表示粮食为x时，最多可以收留的动物数。