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

    Time Limit: 1500MS   Memory Limit: 131072K
    Total Submissions: 30244   Accepted: 8407

    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

    POJ Monthly--2006.12.31, Sempr
    #include<iostream>  
    #include<stack>  
    #include<cstring>
    #include<cstdio>
    #include<algorithm>  
    using namespace std;  
    const int MAXN = 30005;  
    const int INF = 9999999;  
    const int MAXE = 150005;  
    struct Edge  {  
        int v,w;  
        int next;  
    }e[MAXE];;
    int dis[MAXN], head[MAXN];  
    bool exist[MAXN];  
    int size,n,m;
    void add_edge(int u,int v,int w){
    	e[size].v=v;e[size].w=w;
    	e[size].next=head[u];head[u]=size++;
    }
    stack<int> st;
    void SPFA(){
    	memset(exist,0,sizeof(exist));memset(dis,0x3f,sizeof(dis));
    	st.push(1);exist[1]=true;dis[1]=0;
    	while(!st.empty()){
    		int u=st.top();st.pop();
    		exist[u]=false;
    		for(int i=head[u];i!=-1;i=e[i].next){
    			int v=e[i].v,w=e[i].w;
    			if(dis[v]>dis[u]+w){
    				dis[v]=dis[u]+w;
    				if(!exist[v]) {st.push(v);exist[v]=true;}
    			}
    		}
    	}
    }
    int main(){
    	int i,a,b,c;
    	scanf("%d%d",&n,&m);
    	for(int i=0;i<=n;i++) head[i]=-1;
    	size=0;
    	for(int i=0;i<m;i++){
    		scanf("%d%d%d",&a,&b,&c);
    		add_edge(a,b,c);
    	}
    	SPFA();
    	printf("%d
    ",dis[n]);
    	return 0;
    }  
    

      

  • 相关阅读:
    C语言实现—学生成绩管理系统
    C++ 制作一个“测运”小游戏-rand()函数的应用
    C语言实现-航空订票系统(飞机订票系统)
    测试随笔功能
    ASP.Net 连接多个数据库之间的切换
    190906mysql常用语法
    190327 Python登录接口
    190221 百元百鸡
    181102 Windows下安装kivy(用python写APP)
    181102 Python环境搭建(安装Sublime Text3)
  • 原文地址:https://www.cnblogs.com/suishiguang/p/6292368.html
Copyright © 2011-2022 走看看