zoukankan      html  css  js  c++  java
  • codeforces 28D(dp)

    D. Don't fear, DravDe is kind
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A motorcade of n trucks, driving from city «Z» to city «З», has approached a tunnel, known as Tunnel of Horror. Among truck drivers there were rumours about monster DravDe, who hunts for drivers in that tunnel. Some drivers fear to go first, others - to be the last, but let's consider the general case. Each truck is described with four numbers:

    • v — value of the truck, of its passangers and cargo
    • c — amount of passanger on the truck, the driver included
    • l — total amount of people that should go into the tunnel before this truck, so that the driver can overcome his fear («if the monster appears in front of the motorcade, he'll eat them first»)
    • r — total amount of people that should follow this truck, so that the driver can overcome his fear («if the monster appears behind the motorcade, he'll eat them first»).

    Since the road is narrow, it's impossible to escape DravDe, if he appears from one side. Moreover, the motorcade can't be rearranged. The order of the trucks can't be changed, but it's possible to take any truck out of the motorcade, and leave it near the tunnel for an indefinite period. You, as the head of the motorcade, should remove some of the trucks so, that the rest of the motorcade can move into the tunnel and the total amount of the left trucks' values is maximal.

    Input

    The first input line contains integer number n (1 ≤ n ≤ 105) — amount of trucks in the motorcade. The following n lines contain four integers each. Numbers in the i-th line: vi, ci, li, ri (1 ≤ vi ≤ 104, 1 ≤ ci ≤ 105, 0 ≤ li, ri ≤ 105) — describe the i-th truck. The trucks are numbered from 1, counting from the front of the motorcade.

    Output

    In the first line output number k — amount of trucks that will drive into the tunnel. In the second line output k numbers — indexes of these trucks in ascending order. Don't forget please that you are not allowed to change the order of trucks. If the answer is not unique, output any.

    Examples
    input
    Copy
    5
    1 1 0 3
    1 1 1 2
    1 1 2 1
    1 1 3 0
    2 1 3 0
    output
    Copy
    4
    1 2 3 5
    input
    Copy
    5
    1 1 0 3
    10 1 2 1
    2 2 1 1
    10 1 1 2
    3 1 3 0
    output
    Copy
    3
    1 3 5

     

    /*
    这道题.....雾......
    就是按l+r+c分类嘛....
    可是...但可是....可但是.....
    算了,copycopygiveup..... 
    */
    
    #include<bits/stdc++.h>
     
    using namespace std;
    const int Inf=1e9;
    struct truck
    {
        int v,c,l,id,sum;
        truck(int v,int c,int l,int id) : id(id), v(v), c(c), l(l) {}
    };
    vector<truck> t[300010];
    map<int,pair<int,int> > mp;
    vector<int> ans;
    int Nxt[300010];
    int n;
    int main()
    {
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            int v,c,l,r ;
            scanf("%d%d%d%d",&v,&c,&l,&r);
            t[c+l+r].push_back(truck(v,c,l,i));
        }
        int res=0;
        ans.clear();
        for(int s=0; s<300010; s++)    //枚举c+l+r的长度
        {
            if(t[s].size())
            {
                mp.clear();
                int len=t[s].size();
                mp[s]=make_pair(0,Inf);
                for(int i=len-1; i>=0; i--)
                {
                    int l=t[s][i].l;
                    int c=t[s][i].c;
                    int v=t[s][i].v;
                    int cnt=l+c;
                    if(mp.find(cnt)==mp.end()) continue;
                    int val=v+mp[cnt].first;   //mp存储dp结果
                    Nxt[i]=mp[cnt].second;
                    if(mp[l].first<val)
                    {
                        mp[l]=make_pair(val,i);    //人数值对应最大价值和当前vector中的编号
                    }
                }
                if(res<mp[0].first)
                {
                    res=mp[0].first;
                    ans.clear();
                    for(int i=mp[0].second; i<Inf/2; i=Nxt[i])
                    {
                        ans.push_back(t[s][i].id);
                    }
                }
            }
        }
        printf("%d
    ",ans.size());
        for(int i=0; i<ans.size(); i++)
        {
            printf("%d",ans[i]);
            if(i!=ans.size()-1)printf(" ");
        }
        return 0;
    }
     
  • 相关阅读:
    20155220 吴思其 《网络攻防》 Exp1 PC平台逆向破解(5)M
    20155220 《信息安全系统设计基础》课程总结
    2017-2018-1 20155220 《信息安全系统设计基础》第十四周学习总结
    2017-2018-1 20155220 《信息安全系统设计基础》第十三周学习总结
    2017-2018-1 20155220 实验五 通讯协议设计
    2017-2018-1 20155220实验四——外设驱动程序设计
    20155220 《信息安全系统设计基础》第11周学习总结
    《信息安全技术》实验四 木马及远程控制技术
    2017-2018-1 20155220 《信息安全系统设计基础》课下实践——实现mypwd
    2017-2018-1 20155220 实验三 实时系统
  • 原文地址:https://www.cnblogs.com/L-Memory/p/9890103.html
Copyright © 2011-2022 走看看