zoukankan      html  css  js  c++  java
  • POJ——T 3159 Candies

    http://poj.org/problem?id=3159

    Time Limit: 1500MS   Memory Limit: 131072K
    Total Submissions: 33328   Accepted: 9349

    Description

    During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids loved candies very much and often compared the numbers of candies they got with others. A kid A could had the idea that though it might be the case that another kid B was better than him in some aspect and therefore had a reason for deserving more candies than he did, he should never get a certain number of candies fewer than B did no matter how many candies he actually got, otherwise he would feel dissatisfied and go to the head-teacher to complain about flymouse’s biased distribution.

    snoopy shared class with flymouse at that time. flymouse always compared the number of his candies with that of snoopy’s. He wanted to make the difference between the numbers as large as possible while keeping every kid satisfied. Now he had just got another bag of candies from the head-teacher, what was the largest difference he could make out of it?

    Input

    The input contains a single test cases. The test cases starts with a line with two integers N and M not exceeding 30 000 and 150 000 respectively. N is the number of kids in the class and the kids were numbered 1 through N. snoopy and flymouse were always numbered 1 and N. Then follow M lines each holding three integers AB and c in order, meaning that kid A believed that kid B should never get over c candies more than he did.

    Output

    Output one line with only the largest difference desired. The difference is guaranteed to be finite.

    Sample Input

    2 2
    1 2 5
    2 1 4

    Sample Output

    5

    Hint

    32-bit signed integer type is capable of doing all arithmetic.

    Source

     
    题意:n个人,m个关系,a b c 表示 a最多比b少c 即 d[b]-d[a]<=c—>>d[b]<=d[a]+c
    SPFA有队列会超时、、、、呃呃呃
     1 #include <cstring>
     2 #include <cstdio>
     3 #include <stack>
     4 
     5 const int N(30000+15);
     6 const int M(150000+5);
     7 int n,m,u,v,w;
     8 int head[N],sumedge;
     9 struct Edge
    10 {
    11     int v,next,w;
    12     Edge(int v=0,int next=0,int w=0):
    13         v(v),next(next),w(w){}
    14 }edge[M];
    15 inline void ins(int u,int v,int w)
    16 {
    17     edge[++sumedge]=Edge(v,head[u],w);
    18     head[u]=sumedge;
    19 }
    20 
    21 int dis[N];
    22 bool instack[N];
    23 int SPFA(int s)
    24 {
    25     for(int i=1;i<=n;i++)
    26         instack[i]=0,dis[i]=0x7fffffff;
    27     dis[s]=instack[s]=0;
    28     std::stack<int>sta; sta.push(s);
    29     for(;!sta.empty();)
    30     {
    31         u=sta.top(); sta.pop(); instack[u]=0;
    32         for(int i=head[u];i;i=edge[i].next)
    33         {
    34             v=edge[i].v;
    35             if(dis[v]>dis[u]+edge[i].w)
    36             {
    37                 dis[v]=dis[u]+edge[i].w;
    38                 if(!instack[v]) instack[v]=1,sta.push(v);
    39             }
    40         }
    41     }
    42     return dis[n];
    43 }
    44 
    45 inline void read(int &x)
    46 {
    47     x=0; register char ch=getchar();
    48     for(;ch>'9'||ch<'0';) ch=getchar();
    49     for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
    50 }
    51 
    52 int AC()
    53 {
    54     for(;~scanf("%d%d",&n,&m);)
    55     {
    56         for(;m--;ins(u,v,w))
    57             read(u),read(v),read(w);
    58         printf("%d
    ",SPFA(1));
    59         memset(head,0,sizeof(head));
    60         memset(edge,0,sizeof(edge));
    61         sumedge=0;
    62     }
    63     return 0;
    64 }
    65 
    66 int Hope=AC();
    67 int main(){;}
    ——每当你想要放弃的时候,就想想是为了什么才一路坚持到现在。
  • 相关阅读:
    【题解】P1999 高维正方体
    【题解】 P1850 [NOIP2016 提高组] 换教室(又是一道debug的DP,debug经验++)
    【题解】P1439 【模板】最长公共子序列
    【笔记】还是发上来作为学习过的记录吧,凌乱,勿进
    为什么我不会做数位DP
    【题解】HUD3652 B-number && 数位DP学习笔记
    【题解】LIS(longest increasing subsequence)最长上升子序列
    lingo重点部分快速上手
    koa2转移json文件地址
    Koa2创建项目
  • 原文地址:https://www.cnblogs.com/Shy-key/p/7468753.html
Copyright © 2011-2022 走看看