Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

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


Ïà¹ØÎÊ´ð£º

¸ÕѧC£¬ÓÃCʵÏÖ±àÂë - C/C++ / CÓïÑÔ

#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......

C/SÏîÄ¿¼Ü¹¹Éè¼Æ----ÇóÖú - Java / Java SE

±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬ 
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£ 
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......

C/C++/MFCȺ - C/C++ / ·Ç¼¼ÊõÇø

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

cÓïÑÔʵÏÖlinux timeÏà¹Øº¯Êý - C/C++ / CÓïÑÔ

ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
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 ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ