2019CCF ES WR BRR ERE FI TALES — 86
(CSP-S) #5 C++BSRaRMAS
TAiEBtE): 2019 4 10 A 19 A 09:30~11:30
BARB:
© MACH 10 Tl, ARMAOHT 1 TL, Tar 100 4+. HEALS,
CEA LNT.
© AAEM PR COTS. FHL. A BABE Fae
GER.
—. POLAR GE 15 GB, 2 ot, Hit 3304; BMA AMAT
BD
1. BAM: int a=7; float x=2.5, y=4.7; WM disk xtah3* (int) (x+y) 42
WMA: CD)
A. 0.000000 B. 2.750000 c. 2.500000 D, 3.500000
2. FAUT RSC CD
AL WMV B. MPEG C. JPEG b. AVI
3. ae 11 1011 1001 O111 Fl O1 O110 1110 1011 HERTHA MBRIA HEH
RHE CD»
A. vy 1111 110! Uitl Be U1 TMNT 1111 1101
C. 10 1111 110! Vii D. 11 1141 1111 1111
4, MERE SHARE CD
iE GAS ARI TD
B
G a
D. H— aaeaRee
. BARRE x Jy float ACURA, TUDO Iai x MSE ER EAB ds
sit ae FRM HAWE CY
A. x=(x#100+0. 5) /100. 0; B. x=(int) (x#100+0. 5) /100. 0;
CC. x=(x/100+0, 5)**100, 0; D. x=w#100+0. 5/100. 0;
eo
6. HACE 1,1, 2,4,8,8 PRAIA 4 AAAI BUE CO) 6
AL 104 B. 102 C 98 D. 100
7. TPM SORES, ARETE ARETE, WC) JE ASRHE
Fe
AL PRGHERE = B. PCBeHAHERE oC. BEE D. JAS RHEE
CCF CSP-S 2019 i —¥E CHR TTR AE
PAB, Fe10K 8G AMEE CRAMMMEH) , SH 28 Rid, MMRDA
©) Milxi.
A 10 B 9 CG ol dD 8
9. —HEBEE Ty LARK, Wn 0. 1. 8 BIDAR. 6 Mi KE
9,9 AURA 6, HTL ROMS. A, Hee
CEBU AT LAGI AR TH, ECM 106 SGRLAAL GOL. HERBERT BAF AI
Fi SABE, FEAT 0 Bi 9. TTDI NTH Hi o> 4: ALOK
FORA RH, FREAD 5 HER 3 MER? CD
A. 40 B. 25 Cc. 30 D. 20
10. —-YIAARIN, SEHEAT 15 AMES, 47 12 AIBICHSE, JRALAT 4
iB, SAVED, BAIRD ATTA HLL A? CO)
AL 23 B21 Cc. 20 D. 22
LL A A BRM TIA n AA, BCE A A BOA dF RR “MIE
EPR, Gf In) Tota DAT Ree uae Aid BERGE, CAS F
RDBMS DAUR? CD.
A B. nlogn C. 2n Dv. 2n-1
8
ORB Pe RT DA AEC)
A BS C. BAS D. bigest:
13, DA PME EARP IE? CD
A. Dijkstra Wi B. Floyd WH C. Prim WH DV. Kruskal Hi
14. A BA, SEA EHO, HA — WA — GP AE 2 FA 118098,
fH) 186, GLI) BBO MT HEMI ZL? CD
A 5 B38 C4 b 2
a
= AIS ROA CE = IEA i Aas. BAT as BAT
(VIM AE BAIR Ady, 22° FAT BMAGy 1, An2,1Anne Ways ITH
HEATH Bay RAPA ART NS aS BAT i Mj
SINR GZAR I A Ae 1 FTF Slay 1 On 25 oo Onn PRA AE,
PEE LEZ A AK
ye
1 Gaz
af, Shia,
oO
CCF CSP-S 2019 $0 CHIR FiRMD AE
Iw, SOM A&C) Mays Bla, AUF LE RAL, JP AL
Cli) fol=clol(jl=0, MCLi[j] = ( ).
A. max{Cli- 1 -1),¢l- UU) +4,
B. Cli- 1) - 1) +¢li- 10)
Cc. max{Cli- Uj -1,¢0% - ub+1
Db. max{C[i— 1), Cli- U3 + ai,
using namespace std;
int nj
int a[10e];
int main() {
scanf("%d", &n);
for (int i= 1; i <= n; +i)
9 scanf("%d", &a[i]);
1@ int ans = 1;
11 for (int i = 1; i <= nj +#i) {
12 if (i > 1 && afi] < afi - 1])
13 ans = 4
14 while (ans ¢ n && a[i] >= a[ans + 1])
15 ++ans;
16 print#("%d\n" ans);
v7}
18 return @5
19 }
BHI
1) (14) Fi 16 frit ans Ht, ans MIEKA i. CD
2) (15d) FEARMMHAY ans )FEF un. CD
3) PS 12 Ti “<6” By “I=”, FRA Re. CD
4) “TEI 16 TN, AHans—-i>2, Wali+1] sali], ( >
> ke
CCF CSP-S 2019 948 CHIR ETRE A i
WIM, F10H = 5) (34>) FaARY a BAL PRB, WARE TB Uo
RER CD.
A. O(logn) B. O(n?) ©. O(mlogn) D. O(n)
6) Rete B, ICRA AAY Tal Sa Ake CO)
AL O(n?) B. O(logn) c O(n) D. O(nlogn)
#include
using namespace std;
i
2
3
4 const int maxn = 1000;
5 int n;
6 int fa[maxn], cnt[{maxn];
z
8
9
int getRoot(int v) {
if (fa[v] == v) return v;
1@ return getRoot(fa[v]);
11 }
12
13 int main() {
14 cin >> 13
15 for (int i = 0; i < nz ++i) {
16 fafi] = ;
17s ent[i] = 45
18}
19 int ans = w;
20 for (ant i= 0, i a >> b;
23. x = getRoot(a);
24 y = getRoot(b);
25. ans += cnt[x] * cnt[y];
26 fa[x] = y;
27 cnt[y] += cnt[x];
28}
29 cout << ans << endl;
30 return 0;
31 }
NTE
1) (14}) MAIN a Mlb AA AE[O, n-1) TA. CD
CCF CSP-8 2019 FE CHIH DMA te “ees
Mavi, stove 2) (14d) Hi 16 trek “fali] = 03”, BMEFIATAR. Cd)
3) SMA a Alb FUSE[@, n-1] HA, WTO
2 #include
3 using namespace std:
4 const int maxi = 202;
5 string s, t;
6 int pre[maxl], suf[max1];
ZI
8
int main() {
9 cin >> s >> t;
1@ int slen = s.length(), tlen = t.length();
11 for (int i = 0, j = @; i < slen; ++i) {
12. if (j < tlen a& s[i] == t[J]) +5
13 pre[i] = j3 // t[0..j-1]% s[O. A] SFA
14}
15 for (int i = slen - 1, j = tlen - 1; i >= @; --i) {
16 if Gj 8& s[i] == t[j]) --55
47 suf[i] = j; // t[j+1..tlen-1]@ s[i..slen-1] (4) (/F3
19 suf[slen] = tlen - 1;
2@ int ans = @;
CCF CSP-S 2019 3848 CHIE
sul, F100 Fu
21 for (int i = @, j = @, tmp = @; i <= slen; ++i) {
22 while (j <= slen && tmp >= suf[j] + 1) ++3;
23 ans = max(ans, j - i - 1);
24 tmp = pre[i];
25}
26 cout << ans << endl;
27. return @;
28 }
WA:
t[O..pre[i]-1]& s[0. .i] NFM;
t[suf[i]+1..tlen-1]/# s[i..slen-1] i) /7 7.
PU
1) (14>) PLM, suf BH: AERO
3) (24>) APS HB 37TI, “j-i- 1’ -e Rhte ¢ )
4) (24) 4tkes i CAIN, pre MAA suf Ma: MEMO <
isufli+1]+1. ( )
JPR
5) #tlen=10, finite. WslendthA ( ).
AL 10 blz c 0 D1
6) #itlen=10, iti 2, Wsleniksy( ).
A 8 B. 10 c. 12 Dod
> TERRY CGEM, AEA 3 Zp, Sit 30 FP)
CARY A RIBFE) —MEAD EEE a SULA BEAM AE
MA, AOA EMAIL, THLE Pe a IN
BA. FARA Z IT, HAIR — AEA SE ES
BAIT LAMA aA, EME AMAIA, taf inl Hue
LHEF LL DBR
AD TAATH, DH THRA SM 1 sons 10%), UROAK
4th (S107) «
BERK nthe Fi TT AEM, FP SRA EA) TS i MAR ITT RS
HRA (S107), VAR RRB i MEARE (< 104) .
CCF CSP-S 2019 $8 CH ME AE
Wow, stow BRKT. HiTMR—PMom, (Osm
using namespace std;
const int maxn = 1001;
int cnt[maxn];
int child[maxn] [maxn];
int unlock {maxn];
int points;
1@ int threshold{maxn], bonus[maxn];
i
2
s
4
5 int n;
6
7
8
9
12 bool find() {
13 «int target = -1;
14 for (int i = 1; i <= nj ++#i)
15 if (D && @) {
16 target =
a7 break;
18 }
19 if (target == -1)
20 return feise,
21° unlock[{targec| =
22 @,
23 for (int i = @; i < cnt[target]; ++i)
a3
24 @;
25 recurn true;
26 }
27
28 int main() {
29 scanf("%d%d", &n, points);
3@ for (int i = 1; i <= nj +44) {
31 ent[i] = 9;
32 —scanf("%d%d", &threshold[i], bonus[i]);
33}
34 for (int i = 1; i <= nj +44) {
35 int m;
36 scanf("%d", &m);
37 3
CCF CSP-S 2019 HE CHIR AEA
MTV. Frou oa 38
39
40
41
42
43
44
45
46
47
48
49
58
1)
A.
B.
C.
D.
s
= pr Be
3,
pt me
4
Fay
erp
for (int j = 0; 3 < m; +49) {
int fa;
scanf("%d", &fa);
child[fa][cnt[fa]] = i;
++cnt[fa];
}
}
int ans = Q;
while (find())
++ans;
printf("%d\n", ans);
return @;
}
Osha CD
unlock[i] <= @
unlock[i] >= @
unlock[i] == @
unlock[i] == -1
Qin ( )
threshold[i] > points
threshold[i] >= points
points > threshcld[i]
points >= threshold[i]
Suns ¢ )
target = -1
--cnt [target]
oonus;carget] = @
points += bonus[target]
abn CD
ent[child[target][i]] -= 1
cnt[child[target][i]] = @
unlock[child[target][i]] -= 1
unlock[child[target][i]] = @
OsEMH C )
unlock[i] = cnt[i]
unlock[i] = m
unlock[i]
unlock[i]
“a
CCF CSP-S 2019 %—48 CHAAR AE 2
CRA TD) Alice Al Bob FP ATESURTT FURR. LATE Ton RTT I
FU, Bix: WW RAF SATS F afi] LATS F bli.
MZ AUATET WIE DEAT Fe MATHER TT. MURA RIET ARTI
Tih HAY FE EF, ABA at. FRAT m 4S. i
FLFR TT FO A EAT WE TH
ABT HAT ER, TAMU ens 64), URE
%&m (<107) »
ERK 047. Bi TAP TMM afi) bli]. (1 < ali] < 107,1 < bli] <
64)
WRADE LIN ADHE, AAR “Win”. ¢Tlltmtl “Loss” .
UGX MAB. cP bai 64, LMT DLE
Ds BEMARAS «
BNET, tans LAR ASF 6 (19 — ME EA.
status EIHE GAK A
WUth EFF.
AGL:
fm” Bos EAMG SEE, CERES AMIEL) © Ey 1, 1 I
e:
TH 8" ee RA ER SE “CA NS He Bee OAL
AY EL —— BEALE, EAS RANA, CER tt
WHI @, ZI
ull Hib FHA. EMIT unsigned long long 3%.
inc’ ude
#include
using namespace std;
int n, m;
int a[maxn], b[maxn];
9 unsigned long long status, trans;
10 bool win;
1
2
3
4
5 const int maxn = 64;
6
7
8
12 int main() {
13° scanf("%d%d", &n, &m);
14 for (int i = @; i < nj +44)
15 scanf("%d%d", Bali], &b[i]);
CCF CSP-S 2019 8 CHIR ARM A te
Movi. S100 16 for (int i = 0; i a1) {
19 swap(a[i], a[j]);
20 swap(bli], b[j])3
21 }
22 ~~ status
23 trans
24 «for (int i=1, j =
25 while (j > 1 * win
C, trans = status * trans | win
D. status = status << 1 * win
CCF CSP-S 2019 $2 CHIR ATE AE
HOH, S10
D.
ali] > i