Comments
On duonggsimp → help me this ST problem, 12 months ago
0

nhi tinh noi gi cung ngu orz
0

persistent segment tree to find kth elements
On Alphx → CSES DP section Editorial, 14 months ago
+3

it means 2413
On Alphx → CSES DP section Editorial, 14 months ago
+2

it means 2413
0

Auto comment: topic has been updated by thaonguyendethuongvai (previous revision, new revision, compare).
On duonggsimp → help me this ST problem, 15 months ago
0

he 's just a kid kid watching skibidi dop dop yes yes. Confusing between question and answer mean he didn't actually care about your comment so don't give a fck to him.
0

ok thanks :D
0

thank you :D
+1

ok thanks bro

0

what happened here, i have just came but CodingKnight comment was erased.
0

anhphant help me help me
0

https://mirror.codeforces.com/edu/course/2/lesson/4/4/practice/contest/274684/problem/C
On duonggsimp → help me this ST problem, 17 months ago
0

english con cac
On whyalwaysmezzz → I lost all my code, 18 months ago
-10

gâu gâu gâu gâu
0

can somebody give me an example why my greedy on problem C didn't work ( it worked well till line 189th appeared difference ),please. ~~~~~ a[n+1] = 0; for ( tn i = 1; i <= n / 2; i++ ){ if ( a[i] != a[n-i+1] ){ // ( tn means int ) swap(a[i],a[n-i+1]); if ( ( a[i] == a[i-1] ) || ( a[i] == a[i+1] ) || ( a[n-i] == a[n-i+1] ) || ( a[n-i+2] == a[n-i+1] ) ) swap( a[i] , a[n-i+1] ); } } tn ans = 0; for ( tn i = 1; i <= n; i++ ) ans += a[i] == a[i+1]; ~~~~~