BI 1: HAOI 4000

M gi bi: HAOI4000

Sau gn 4000 ln t chc HAOI, Ban t chc HAOI 4000 ang xem xt mt phng n t chc mi, theo phn thng cha chc trao cho nhng th sinh c im cao nht. Thay vo , mt th sinh nu nhn c phn thng th phn thng phi c gi tr bng im s ca th sinh ny bt k s im l thp hay cao (d nhin phi ln hn 0). Yu cu: Bn hy gip Ban t chc HAOI 4000 tm ra mt phng n trao gii sao cho c nhiu th sinh c nhn phn thng nht. D liu: Trong file vn bn HAOI4000.INP gm Dng th nht ghi s N l s th sinh v K l s tin ca Ban t chc. Dng tip theo ghi N s t nhin theo th t l im s ca cc th sinh c nh m s t 1 n N. Kt qu: Xut ra file vn bn HAOI4000.OUT gm Dng u ghi mt s l s th sinh nhiu nht c th c nhn thng. Dng tip theo ghi danh sch m s ca cc th sinh c nhn thng. V d: HAOI4000.INP 4 10 8 9 1 2 Gii hn: N 30 000 HAOI4000.OUT 2 1 3

K 2 109 im ca cc th sinh khng qu 2 109 Thi gian: 1 giy B nh: 1M Dy s trung bnh

Tun ny, Bigbay c mt bi ton rt ngn: Cho mt dy s di N, tm dy con di nht c gi tr trung bnh ln hn gi tr ave cho trc. Input: Aveseq.In

-

Dng u ghi s nguyn dng N, v s nguyn ave. N dng sau, mi dng ghi mt s nguyn ai (|ai| m) return Sum(i,j,m+1,l,2*d+1); if (j> n; InitTree(1,1,MAXN); long s=0; for (long i=1; i> u; Modify(u); s+=Sum(u+1,MAXN,1,MAXN,1); } out kqo; ans >> kqm; if (kqm!=kqo) return 10; // wrong answer return 0; } // Ham in ket qua int viet() { int i; cout