c Ëã·¨
A=(a1,a2,...,an)ºÍB=(B1,B2,...,Bn) (1,2,nΪϱê) ÊÇÁ½¸öÏßÐÔ±í(¼Ù¶¨Ëùº¬Êý¾ÝÔªËØ¾ùΪÕûÊý).Èôn=mÇÒai=bi(i=1,...,n),Ôò³ÆA=B ;Èôai=bi(i=1,...,j),ÇÒaj+1(j+1Ϊϱê)<bj+1(j<n<=m),Ôò³ÆA<B;ÔÚÆäËüÇé¿ö Ͼù³ÆA>B;ÊDZàдһ¸ö±È½ÏAºÍBµÄËã·¨,µ±A<B,A=B»òA>Bʱ·Ö±ðÊä³ö-1,0»ò1
Â¥Ö÷¿ÉÒÔÓÃÊý×éÀ´ÊµÏÖ¡£¡£ÒýÓà ¥Ö÷¿ÉÒÔÓÃÊý×éÀ´ÊµÏÖ¡£¡£ ¿ÉÒÔ°ïæ дһ¸öÂð. ÎÒ²»¶®CµÄÓï·¨. »¹ÊÇÓÃÁ´Ê½´æ´¢±È½ÏºÃ£¬ÒòΪҪ±È½Ï³¤¶ÈµÄÂï ÎÞÓï Õâô¼òµ¥Ò²ÎÊ ×Ô¼º¿´Êý¾Ý½á¹¹°É ½¨ÒéʹÓÃGLib¿âµÄGSList½á¹¹£¨µ¥Á´±í£©¡£ÒýÓà ÎÞÓï Õâô¼òµ¥Ò²ÎÊ ×Ô¼º¿´Êý¾Ý½á¹¹°É Äã˵¼òµ¥ Äã¾Í×öÒ»¸ö¡£Ð»Ð»¡£ ÎÒ²»ÊÇʲô¶¼¶®¡£³õѧ¶øÒÑ¡£ ÎÒÖªµÀÄãNB¡£ ÎÒ¾ÍÊÇÒª×Ô¿¼ Êý¾Ý½á¹¹¡£ ËùÒÔ²ÅÎʵġ£ÒýÓà ½¨ÒéʹÓÃGLib¿âµÄGSList½á¹¹£¨µ¥Á´±í£©¡£ ÎÒÒª´úÂ룬 Âß¼ÎÒ¶®¡£¡£ ÎÒÒ²ÊÇ×ö³ÌÐòµÄ ¡£¡£¡£ Õâ¸ö³ÌÐò±àµÄ¸Ð¾õ²»¹»¼òÁ·£¬Â¥Ö÷²Î¿¼°ÉC/C++ code: #include<stdio.h> #define maxsize 100//maxsizeΪÁ´±í×î´ó³¤¶È typedef struct//Á´±í½Úµã¶¨Òå { int elem[maxsize]; int last;//¼Ç¼ÏßÐÔ±í×îºóÒ»¸öÔªËØÔÚÊý×éelem[]ÖеÄλÖã¨Ï±êÖµ£© }SeqList; int Compare(SeqList p,SeqList q)//Á´±í±È½Ïº¯Êý { int flag1=1,flag2
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏ struct hostent *hp; char AlarmDevIP[20]; int x2; hp = gethostbyname("www.google.com"); if (hp) {
......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡ ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
°ï°ï棬лл~ 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 ......
ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º gcc -c log.c ar crv liblog.a log.o ±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......
ÎÒÏÖÔÚÏë×öÒ»¸ö»ùÓÚTCPµÄ C/SµÄÁÄÌì³ÌÐò£¬Ôõô²ÅÄÜʵÏÖÓû§ÐÅÏ¢µÄÈÏÖ¤µÇ¼£¬ socketͨÐŽ¨Á¢Á¬½Óǰ£¬ÏÈ·¢ËÍÓû§Ãû£¬ÃÜÂëµÈ£¬ÈÏÖ¤ Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄÜ·¢ËÍѽ ÒýÓà Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄ ......