c¹é²¢ÅÅÐò - C/C++ / CÓïÑÔ
void guibing(int a[],int n)
{
}
ÎÒÒѾ³õʼ»¯ÁËÒ»¸öÊý×éa[30000]ÇÒ¸³Öµ,Ïë¶ÔÕâ¸öÊý×é½øÐй鲢ÅÅÐò¡£
µ«ÊǾßÌåÔõôʵÏÖ»¹ÊDz»ÖªµÀ¡£ÇóÔ´Âë
±ÈÈç˵¡£ÏÈÒ»¸öÒ»¸öÅÅÐò£¬È»ºóÔÙ½«ÅÅÐòºÃµÄÁ½¸öÁ½¸öÅÅÐò¡£ÄÇôÕâ¸öÅÅÐò¹ý³ÌÖÐÔõô¾ßÌåʵÏÖ¡£
156342
15 36 24
Ôõô°Ñ15ºÍ36ºÏÆðÀ´×é³É1356?
¹é²¢ÅÅÐò²»ÊǰÑ15Óë36ºÏÆðÀ´±ä³É1356°É£¿ÖмäÓ¦¸ÃÓпոñ¸ô¿ª±íʾÁ½¸öÊý£¡
ÊÇÕâÑùµÄ£º
Ê×ÏȱȽÏÍ· 1 5
3 6
·¢ÏÖ1±È½ÏС£¬¾Í°Ñ1ÒÆµ½Ò»¸öÁÙʱÊý×éÖУ¬
ÁÙʱ 1
5
3 6
ÔÙ·¢ÏÖ3±È½ÏС
ÁÙʱ 1 3
5
6
·¢ÏÖ5±È6С
ÁÙʱ 1 3 5
6
Ö»ÓÐÒ»¸öÊý×éÁË£¬¾ÍÈ«ÒÆ¶¯ÁÙʱÊý×éÖÐ
ÁÙʱ 1 3 5 6
ÔÙ°ÑÁÙʱÊý×éÖеÄÔªËØÔÙÈ«²¿¸´ÖÆ»ØÀ´¡£
¹é²¢´úÂ룺C/C++ code:
#include <stdio.h>
#define MAXN 22000
int a[MAXN+1],c[MAXN+1];
long long cnt;
void MergeSort(int l, int r){
int mid, i, j, tmp;
if( r > l+1 ){
mid = (l+r)/2;
MergeSort(l, mid);
MergeSort(mid, r);
tmp = l;
for( i=l, j=mid; i < mid && j < r; ){
if( a[i] > a[j] ){
c[tmp++] = a[j++];
cnt += mid-i;
}
else c[tmp++] = a[i++];
}
if( j < r ) for( ; j < r; ++j ) c[tmp++] = a[j];
else for( ; i < mid; ++i ) c[tmp++] = a[i];
for ( i
Ïà¹ØÎÊ´ð£º
#include "stdio.h"
int main()
{
char *ch(char *, char *);
char str1[]="I am glad to meet you!";
char str2[]="Welcom to study C!";
&nb ......
ÎÒÏÖÔÚҪЩһ¸öfortranµ÷ÓÃC½Ó¿ÚµÄÎÊÌ⣬µ«ÊDz»ÖªµÀ CÓïÑÔÀïÃæ·ÖÅäµÄÖ¸ÕëÔõô¸¶¸øfortran,ÓÖ²»ÄÜÔÚfortranÁ¢ÂíÏÈ·ÖÅäºÃ£¬ÒµÎñÉϲ»ÔÊÐí¡£
ÎÒдÁ˸ö²âÊÔµÄÀý×Ó¡£µ«ÊDz»ÐС£
test.c
#include <stdio.h>
#incl ......
·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ
ѧϰ£¬¿´¿´
¼ÌÐø¶¥Å¶
ѧϰÁË¡£
go o ......
¸÷λ´óÏÀ£º
ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......