Çó¸ßÊÖ½â´ðÒ»c³ÌÐòµÄ˼Ïë
ʳÎïÁ´
Acceteped : 218 Submit : 579
Time Limit : 1000 MS Memory Limit : 65536 KB
Description
¶¯ÎïÍõ¹úÖÐÓÐÈýÀදÎïA,B,C£¬ÕâÈýÀදÎïµÄʳÎïÁ´¹¹³ÉÁËÓÐȤµÄ»·ÐΡ£A³ÔB£¬ B³ÔC£¬C³ÔA¡£ÏÖÓÐN¸ö¶¯ÎÒÔ1£N±àºÅ¡£Ã¿¸ö¶¯Îï¶¼ÊÇA,B,CÖеÄÒ»ÖÖ£¬µ«ÊÇÎÒÃDz¢²»ÖªµÀËüµ½µ×ÊÇÄÄÒ»ÖÖ¡£ ÓÐÈËÓÃÁ½ÖÖ˵·¨¶ÔÕâN¸ö¶¯ÎïËù¹¹³ÉµÄʳÎïÁ´¹ØÏµ½øÐÐÃèÊö£º
µÚÒ»ÖÖ˵·¨ÊÇ"1 X Y"£¬±íʾXºÍYÊÇͬÀà¡£
µÚ¶þÖÖ˵·¨ÊÇ"2 X Y"£¬±íʾX³ÔY¡£
´ËÈ˶ÔN¸ö¶¯ÎÓÃÉÏÊöÁ½ÖÖ˵·¨£¬Ò»¾ä½ÓÒ»¾äµØËµ³öK¾ä»°£¬ÕâK¾ä»°ÓеÄÊÇÕæµÄ£¬ÓеÄÊǼٵġ£µ±Ò»¾ä»°Âú×ãÏÂÁÐÈýÌõ֮һʱ£¬Õâ¾ä»°¾ÍÊǼٻ°£¬·ñÔò¾ÍÊÇÕæ»°¡£
1£© µ±Ç°µÄ»°ÓëÇ°ÃæµÄÄ³Ð©ÕæµÄ»°³åÍ»£¬¾ÍÊǼٻ°£»
2£© µ±Ç°µÄ»°ÖÐX»òY±ÈN´ó£¬¾ÍÊǼٻ°£»
3£© µ±Ç°µÄ»°±íʾX³ÔX£¬¾ÍÊǼٻ°¡£
ÄãµÄÈÎÎñÊǸù¾Ý¸ø¶¨µÄN£¨1 <= N <= 50,000£©ºÍK¾ä»°£¨0 <= K <= 100,000£©£¬Êä³ö¼Ù»°µÄ×ÜÊý¡£
ÊäÈ룺
µÚÒ»ÐÐÊÇÁ½¸öÕûÊýNºÍK£¬ÒÔÒ»¸ö¿Õ¸ñ·Ö¸ô¡£
ÒÔÏÂKÐÐÿÐÐÊÇÈý¸öÕýÕûÊý D£¬X£¬Y£¬Á½ÊýÖ®¼äÓÃÒ»¸ö¿Õ¸ñ¸ô¿ª£¬ÆäÖÐD±íʾ˵·¨µÄÖÖÀà¡£
ÈôD=1£¬Ôò±íʾXºÍYÊÇͬÀà¡£
ÈôD=2£¬Ôò±íʾX³ÔY¡£
Êä³ö£º
Ö»ÓÐÒ»¸öÕûÊý£¬±íʾ¼Ù»°µÄÊýÄ¿¡£
Sample Input
100 7
1 101 1
2 1 2
2 2 3
2 3 3
1 1 3
2 3 1
1 5 5
Sample Output
3
{{----}
Ïà¹ØÎÊ´ð£º
QQȺ 29152388
ÓÑÇéUP
°ï¶¥
up
°ïup
up Ö§³Ö£¡
up jf
...ÄѵÀÓзÖ..?
up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£
Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ
¼ÓÁË¡£
¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
ÎÒֻѧ¹ýÇ廪À¶·âÃæµÄCÓïÑÔ»ù´¡£¬Ïë¸üÉîÈëµÄѧϰ£¬¸Ã¿´Ê²Ã´ÊéºÃ£¿
C Primer Plus
C³ÌÐòÉè¼ÆÓïÑÔ(µÚ2°æÐ°æ)
CÓïÑÔ³ÌÐòÉè¼Æ_ÏÖ´ú·½·¨
CÓïÑԲο¼ÊÖ²áµÚÎå°æ
CÓïÑÔ´óÈ«
CºÍÖ¸Õë
CÏÝÚåÓëȱÏÝ
Cר¼Ò±à³Ì
......
CÓïÑÔ±à³Ì ´Ó¼üÅÌÉÏÊäÒ»¸öµ¥´Ê Åжϵ¥´ÊÊÇ·ñÔÚ´Ê¿âÓУ¬´Ê¿âÊÇÒ»¸öÎı¾¡£
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£
дµÄ¶Ì
ÒýÓÃ
scanf("%c",&c);
if()ÅжϾÍÐÐÁË¡£
ÇÀSF¡£
......
°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......