锘??xml version="1.0" encoding="utf-8" standalone="yes"?>日韩精品久久久久久,亚洲国产精品无码久久久秋霞2,久久国产精品一区http://www.shnenglu.com/hoolee/category/19707.htmlIf you believe, you can!zh-cnSat, 04 May 2013 13:23:10 GMTSat, 04 May 2013 13:23:10 GMT60- 涓閬撳熀紜鐨勭嚎孌墊爲棰樸?/title>http://www.shnenglu.com/hoolee/archive/2013/04/28/199806.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sun, 28 Apr 2013 10:47:00 GMThttp://www.shnenglu.com/hoolee/archive/2013/04/28/199806.htmlhttp://www.shnenglu.com/hoolee/comments/199806.htmlhttp://www.shnenglu.com/hoolee/archive/2013/04/28/199806.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/199806.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/199806.html闃呰鍏ㄦ枃

]]> - zoj1101--浜屽垎鏌ユ壘鐨勫簲鐢?/title>http://www.shnenglu.com/hoolee/archive/2012/08/01/185938.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Wed, 01 Aug 2012 13:39:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/01/185938.htmlhttp://www.shnenglu.com/hoolee/comments/185938.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/01/185938.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/185938.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/185938.html浜屽垎鏌ユ壘錛屾槸涓縐嶉拡瀵規(guī)湁搴忓簭鍒楃殑鏌ユ壘鏂瑰紡錛屾瘡嬈¤凱浠d細緙╁皬涓鍗婄殑鏌ユ壘鑼冨洿錛屼竴嬈℃煡鎵劇殑鏃墮棿澶嶆潅搴︿負O(logN)銆?br />綆鍗曡涓涓嬩簩鍒嗘煡鎵捐繃紼嬶細鍦ㄦ湁搴忓簭鍒梥eq[]涓壘涓涓暟n錛屽亣璁捐繖涓簭鍒楃殑璧峰涓嬫爣鍒嗗埆涓篴錛宐錛宮id=(a+b)/2錛岄偅涔坣瑕佷箞灝辨槸seq[mid]錛坣=seq[mid]錛夛紝瑕佷箞鍦╩id宸﹁竟錛坣<seq[mid]錛夛紝瑕佷箞鍦╩id鍙寵竟錛坣>seq[mid]錛夛紝瑕佷箞榪欎釜鏁版牴鏈笉鍦╯eq[]涓?br />
涓嬮潰榪欓亾棰樻槸浜屽垎鏌ユ壘鐨勫吀鍨嬪簲鐢細
zoj1101
棰樻剰鎻忚堪錛氬湪緇欏畾鏁存暟搴忓垪錛?lt;=1000錛変腑鎵懼嚭鍥涗釜涓嶅悓鐨勬暟錛屼嬌寰椾笁涓暟鐨勫拰絳変簬鍙﹀涓涓暟銆?br />鐩存帴鐢ㄥ洓灞傚驚鐜搧瀹氳秴鏃訛紝榪欓噷閲囩敤浜嗕竴縐嶆嬁絀洪棿鎹㈡椂闂寸殑鏂瑰紡銆?br />鍋囪鏈塧+b+d=c錛岃繖絳変環(huán)浜巃+b=c-d錛屾垜浠彲浠ユ妸鎵鏈夌殑a+b瀛樿搗鏉ワ紙<=10^6涓級錛屾妸鎵鏈夌殑c-d涔熷瓨璧鋒潵錛?lt;=10^6涓級錛屽綋鎷垮埌姣忎竴涓猘+b鏃舵垜浠彧闇瑕佸湪鎵鏈塩-d鐨勫簭鍒椾腑鏌ユ壘灝辮浜嗐傚厛鎶奵-d搴忓垪鎺掑簭錛屾帓搴忔椂闂村鏉傚害O(NlogN)錛屾煡鎵捐繃紼嬪彲浠ョ敤浜屽垎錛岃繖鏍峰氨涓嶄細瓚呮椂鍟︺?br />浠ヤ笅鏄湰棰樹唬鐮侊細


#include<stdio.h>
#include<stdlib.h>
#define MAX 2100000000
#define LEN 1000010
#define LEN1 1010
typedef struct
{
int rs;
int a;
int b;
}Node;
Node addseq[LEN];
Node subseq[LEN];
int num[LEN1];
int seqlen;
int wagamount;
int binSch(int n, int bg, int ed)//浜屽垎鏌ユ壘——閫掑綊鏂瑰紡
{
if(bg > ed)
return -1;
if(bg == ed)
{
if(n == subseq[bg].rs)
return bg;
return -1;
}
int mid = (bg + ed) / 2;
if(n == subseq[mid].rs)
return mid;
if(n < subseq[mid].rs)
return binSch(n, bg, mid - 1);
if(n > subseq[mid].rs)
return binSch(n, mid + 1, ed);
}
int binSch2(int n, int bg, int ed)//浜屽垎鏌ユ壘——闈為掑綊鏂瑰紡
{
while(bg <= ed)
{
int mid = (bg + ed) / 2;
if(n == subseq[mid].rs)
return mid;
if(n < subseq[mid].rs)
ed = mid - 1;
else
bg = mid + 1;
}
return -1;
}
int findWinner()
{
int i, j;
int n;
for(i = 0; i < seqlen; i++)
{
n = addseq[i].rs;
int a = addseq[i].a;
int b = addseq[i].b;
int find = binSch(n, 0, seqlen - 1);
if(find != -1)
{
int c = subseq[find].a;
int d = subseq[find].b;
if(a != b && a != c && a != d && b != c && b != d && c != d)
{
if(c > wagamount)
wagamount = c;
}
}
}
}
int cmp(const void *a, const void *b)
{
Node *a0 = (Node*)a;
Node *b0 = (Node*)b;
return a0 -> rs - b0 -> rs;
}
int main()
{
int i, j;
int n;
scanf("%d", &n);
while(n != 0)
{
for(i = 0; i < n; i++)
scanf("%d", &num[i]);
seqlen = 0;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
if(j != i)
{
addseq[seqlen].rs = num[i] + num[j];
addseq[seqlen].a = num[i];
addseq[seqlen].b = num[j];
subseq[seqlen].rs = num[i] - num[j];
subseq[seqlen].a = num[i];
subseq[seqlen].b = num[j];
seqlen++;
}
qsort(subseq, seqlen, sizeof(Node), cmp);
wagamount = -MAX;
findWinner();
if(wagamount != -MAX)
printf("%d\n", wagamount);
else
printf("no solution\n");
scanf("%d", &n);
}
//system("pause");
}

]]> - poj3468--緇濆緇忓吀鐨勭嚎孌墊爲棰?/title>http://www.shnenglu.com/hoolee/archive/2012/07/31/185779.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Tue, 31 Jul 2012 12:40:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/31/185779.htmlhttp://www.shnenglu.com/hoolee/comments/185779.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/31/185779.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/185779.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/185779.html寤烘爲涓嬈″畬鎴愶紝鏃墮棿鑺辮垂涓篛(LogN)錛涙煡璇㈢殑鏃墮棿澶嶆潅搴﹂剻浜鴻繕涓嶄細鍒嗘瀽O(∩_∩)O~錛屾渶鍧忓彲鑳芥槸O(N)錛屼笉榪囪繖縐嶆儏鍐靛簲璇ュ緢闅懼嚭鐜幫紱鏇存柊鐨勭畻娉曞煎緱鍟嗘Ψ錛屼笉鍚岀殑絳栫暐鏃墮棿澶嶆潅搴︿細鐩稿樊寰堝ぇ銆備笅闈㈣瑙d袱縐嶆瘮杈冪敤浠ユ兂鍒扮殑鏇存柊絳栫暐銆?br />鏇存柊鏂規(guī)硶涓錛?br />姣忔閮藉皢鎵鏈夎兘鏇存柊鐨勮妭鐐規(guī)洿鏂幫紝榪欑鏂瑰紡鏈鍧忔儏鍐典笅灝嗕細鏇存柊鏍戜腑鎵鏈夎妭鐐癸紝姝ゆ椂鏃墮棿澶嶆潅搴︿負O(N)銆傛湰棰樹嬌鐢ㄨ繖縐嶆柟娉曚細TLE銆?br />鏇存柊鏂規(guī)硶浜岋細
姣忔閮藉敖閲忓皯鐨勬洿鏂拌妭鐐逛俊鎭紝涓庣涓縐嶆柟娉曠浉姣旓紝Node鍐呬細澶氫竴涓彉閲廵n錛屾垜鎶婂畠褰㈣薄鐨勭О涔嬩負“鍔胯兘”錛岃綆楃粨鏋滄椂瑕佸皢璇ョ殑鎵鏈夌埗鑺傜偣鐨?#8220;鍔胯兘”涔熻冭檻鍦ㄥ唴銆傝繖縐嶆柟娉曠殑鏃墮棿澶嶆潅搴︿篃涓嶅ソ鍒嗘瀽錛屼絾鏄庢樉浼樹簬絎竴縐嶆柟娉曘?br />榪欎竴棰樺鏃墮棿鍗$殑寰堢揣錛屼富瑕佹槸鑺卞湪鏍戠殑鏇存柊涓娿?br />鍏充簬綰挎鏍戝彲浠ュ厛鍙傞槄錛?a href="http://www.shnenglu.com/hoolee/archive/2012/07/29/185531.html">http://www.shnenglu.com/hoolee/archive/2012/07/29/185531.html
浠ヤ笅鏄湰棰樹唬鐮侊細


#include<stdio.h>
#include<stdlib.h>
#define LEN 100010
#define LEN0 6550000
typedef struct


{
int a, b;
int l, r;
long long sum;//璁板綍璇ュ尯闂村唴鐨勯儴鍒嗗拰
long long en;//璁板綍璇ヨ妭鐐?#8220;鍔胯兘”銆?/span>
}Node;
int count;
Node A[LEN0];
int allNum[LEN];
void MakeTree(int i)


{
A[i].en = 0;
int a = A[i].a;
int b = A[i].b;
int mid = (a + b) / 2;
if(a == b)

{
A[i].sum = allNum[a];
return;
}
int l = ++count;
int r = ++count;
A[l].a = a;
A[l].b = mid;
A[r].a = mid + 1;
A[r].b = b;
MakeTree(l);
MakeTree(r);
A[i].sum = A[l].sum + A[r].sum;
A[i].l = l;
A[i].r = r;
}
long long Query(int t, int aa, int bb, long long en)


{
int a = A[t].a;
int b = A[t].b;
if(a == aa && b == bb)//1

{
return A[t].sum + en * (bb - aa + 1);
}
int mid = (a + b) / 2;
if(bb <= mid)//2
return Query(A[t].l, aa, bb, en + A[t].en);
if(aa >= mid + 1)//3
return Query(A[t].r, aa, bb, en + A[t].en);
long long suml = Query(A[t].l, aa, mid, en + A[t].en);//4
long long sumr = Query(A[t].r, mid + 1, bb, en + A[t].en);
return suml + sumr;
}
void Update(int t, int aa, int bb, int c)


{
int a = A[t].a;
int b = A[t].b;
int mid = (a + b) / 2;
int l = A[t].l;
int r = A[t].r;
A[t].sum += (bb - aa + 1) * c;
if(aa == a && bb == b)

{
A[t].en += c;
return;
}
if(bb <= mid)
Update(l, aa, bb, c);
else if(aa >= mid + 1)
Update(r, aa, bb, c);
else

{
Update(l, aa, mid, c);
Update(r, mid + 1, bb, c);
}
}
int main()


{
int i, j;
int N, Q;
int a, b, c;
scanf("%d%d", &N, &Q);
for(i = 1; i <= N; i++)
scanf("%d", &allNum[i]);
count = 0;
int t = ++count;
A[t].a = 1;
A[t].b = N;
MakeTree(t);
char str[50];
getchar();
for(i = 0; i < Q; i++)

{
gets(str);
if(str[0] == 'Q')

{
sscanf(&str[1], "%d%d", &a, &b);
long long sum = Query(1, a, b, 0);
printf("%lld\n", sum);
}
else if(str[0] == 'C')

{
sscanf(&str[1], "%d%d%d", &a, &b, &c);
Update(1, a, b, c);
}
}
//system("pause");
}

]]> - 綰挎鏍?/title>http://www.shnenglu.com/hoolee/archive/2012/07/29/185531.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sun, 29 Jul 2012 02:44:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/29/185531.htmlhttp://www.shnenglu.com/hoolee/comments/185531.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/29/185531.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/185531.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/185531.html闃呰鍏ㄦ枃

]]> - poj1862--浼樺厛闃熷垪銆佽椽蹇?/title>http://www.shnenglu.com/hoolee/archive/2012/07/21/184517.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sat, 21 Jul 2012 14:22:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/21/184517.htmlhttp://www.shnenglu.com/hoolee/comments/184517.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/21/184517.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/184517.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/184517.html璐績綆楁硶錛屾瘡嬈¢夊彇閲嶉噺鏈澶х殑涓や釜鐢熺墿鍚堝茍鎴愪竴涓嵆鍙備笅闈㈢殑浠g爜鏄湁浼樺厛闃熷垪錛堝ぇ欏跺爢錛夊疄鐜扮殑銆?br />涓嶈繃錛屾繁鍏ュ垎鏋愪竴涓嬶紝鐢辨暟瀛﹀叕寮忓彲浠ヨ瘉鏄庯細m1+m2 >= 2*sqrt(m1*m2)錛屽洜姝ゅ綋涓や釜鐢熺墿鍚堝茍鍚庯紝閲嶉噺涓瀹氭槸鍓╀綑鐢熺墿涓渶澶х殑錛岀敱姝ゅ彧瑕佸皢鍘熼噸閲忔寜闄嶅簭鎺掑簭涓嬈★紝鐒跺悗渚濇鍚堝茍鍗沖彲銆?br />浼樺厛闃熷垪鏈変簺澶ф潗灝忕敤浜嗐?


#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define LEN 110
void f(double *a, int top, int r)


{//絳涢夊嚱鏁幫紝淇濇寔澶ч《鍫嗙殑鎬ц川銆?/span>
int i, j;
for(j = 2 * top; j <= r; j *= 2)

{
if(j < r && a[j] < a[j + 1])
j++;
if(a[j] <= a[j / 2])
break;
double t = a[j];
a[j] = a[j / 2];
a[j / 2] = t;
}
}
double DeQueue(double *a, int *r)


{
double t = a[1];
a[1] = a[*r];
--*r;
f(a, 1, *r);
return t;
}
void EnQueue(double *a, int *r, double num)


{
++*r;
a[*r] = num;
int i = *r;
while(1)

{
if(i > 1 && a[i] > a[i / 2])

{
double t = a[i];
a[i] = a[i / 2];
a[i / 2] = t;
i /= 2;
}
else
break;
}
}
int main()


{
int i, j;
int N;
int r;
double a[LEN];
double w;
while(scanf("%d", &N) != EOF)

{
for(i = 1; i <= N; i++)
scanf("%lf", &a[i]);
for(i = N / 2; i >= 1; i--)//寤虹珛澶ч《鍫嗭紝鍗蟲槸鍒濆鍖栭槦鍒?/span>
f(a, i, N);
r = N;
while(r > 1)

{
double m1 = DeQueue(a, &r);
double m2 = DeQueue(a, &r);
w = 2.0 * sqrt(m1 * m2);
EnQueue(a, &r, w);
}
printf("%.3lf\n", a[1]);
}
}


]]> - 浼樺厛闃熷垪--鍫嗗疄鐜?/title>http://www.shnenglu.com/hoolee/archive/2012/07/20/184309.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Fri, 20 Jul 2012 02:36:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/20/184309.htmlhttp://www.shnenglu.com/hoolee/comments/184309.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/20/184309.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/184309.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/184309.html闃呰鍏ㄦ枃

]]> - 鍗曡皟闃熷垪http://www.shnenglu.com/hoolee/archive/2012/07/19/184177.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Thu, 19 Jul 2012 04:21:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/19/184177.htmlhttp://www.shnenglu.com/hoolee/comments/184177.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/19/184177.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/184177.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/184177.html闃呰鍏ㄦ枃

]]>
国产精品久久久香蕉|
久久久精品免费国产四虎|
香蕉久久夜色精品国产尤物|
国产精品久久久久影院色|
欧美亚洲国产精品久久久久|
亚洲国产一成久久精品国产成人综合
|
久久国产香蕉视频|
色综合久久久久综合体桃花网
|
麻豆久久久9性大片|
7777久久久国产精品消防器材|
久久人妻少妇嫩草AV无码蜜桃|
一本久久免费视频|
狠狠狠色丁香婷婷综合久久俺|
亚洲午夜久久久久妓女影院|
国产精品99久久久久久猫咪
|
亚洲成色WWW久久网站|
久久国产精品波多野结衣AV|
国产精品女同久久久久电影院|
欧洲性大片xxxxx久久久|
一级a性色生活片久久无少妇一级婬片免费放
|
国产午夜精品理论片久久
|
亚洲av成人无码久久精品|
亚洲国产日韩欧美久久|
久久久久亚洲AV无码专区桃色
|
伊人久久大香线蕉精品|
天天爽天天狠久久久综合麻豆|
51久久夜色精品国产|
久久亚洲精品人成综合网|
久久综合九色综合网站|
av国内精品久久久久影院|
亚洲AV日韩精品久久久久久久|
伊人久久大香线蕉成人|
久久偷看各类wc女厕嘘嘘|
93精91精品国产综合久久香蕉|
青青草国产精品久久久久|
久久久久九国产精品|
国产国产成人精品久久|
精品久久久久久综合日本|
久久午夜无码鲁丝片午夜精品|
开心久久婷婷综合中文字幕|
久久亚洲国产精品123区|