http://poj.org/problem?id=1135 import java.util.Scanner; public class Main { static final int Inf=9999999; public static void main(String[] args) { Scanner in=new Scanner(System.in); int cnt=0; while(true) { cnt++; int n=in.nextInt(); int m=in.nextInt(); if(n==0&&m==0)break; int[][] p=new int[n][n]; for(int i=0;i< n;i++) for(int j=0;j< n;j++) p[i][j]=Inf; for(int i=0;i < m;i++) { int x=in.nextInt()-1; int y=in.nextInt()-1; int len=in.nextInt(); p[x][y]=p[y][x]=len; } boolean[] bb=new boolean[n]; bb[0]=true; int[] time=new int[n]; for(int i=0;i< n;i++) time[i]=p[0][i]; time[0]=0; for(int i=0;i< n-1;i++) { int min=Inf,tag=0; for(int j=0;j< n;j++) { if(!bb[j]&&time[j]< min) { min=time[j]; tag=j; } } bb[tag]=true; for(int j=0;j< n;j++) if(!bb[j]&&p[tag][j]< Inf&&time[tag]+p[tag][j]< time[j]) time[j]=time[tag]+p[tag][j]; } double maxtime=-Inf; int pos=-1; for(int i=0;i< n;i++) { if(time[i]>maxtime) { maxtime=time[i]; pos=i; } } double max=-Inf,t; int pos1=-1,pos2=-1; for(int i=0;i< n;i++) { for(int j=i+1;j< n;j++) { t=(time[i]+time[j]+p[i][j])/2.0; if(p[i][j]< Inf&&t>max) { max=t; pos1=i;pos2=j; } } } System.out.println("System #"+cnt); System.out.print("The last domino falls after "); if(maxtime>=max) System.out.printf("%.1f seconds, at key domino %d.nn",maxtime,pos+1); else System.out.printf("%.1f seconds, between key dominoes %d and %d.nn",max,pos1+1,pos2+1); } } }
Meta
-
Recent Posts
Recent Comments
- MorrissMar on 隆宪叁年-五一
- MorrissMar on 隆宪叁年-五一
- MorrissMar on 隆宪叁年-五一
- bngvlttwnj on 隆宪叁年-五一
- bngvlttwnj on 隆宪叁年-五一
Archives
- May 2024
- April 2023
- February 2023
- January 2023
- December 2022
- November 2022
- September 2022
- June 2022
- July 2021
- January 2021
- February 2020
- September 2019
- March 2018
- February 2018
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
Categories