Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
23:16:18
Register now »
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
0
The answer is (n-min(l+1,n-r)) not max(l+1,r).Here we are opting for min of prefix and suffix so that we get max subsequence of the array. If u still didn't get it try various scenarios which is the only way to answer ur question. |
|
0
The sentence loosely translates to finding the first and last numbers which are not divisble by x in the array and then find the minimum between those numbers and subtract them from array size which gives us our subarray of largest size. |
|
0
Missed this challenge |
|
-8
No , I guess for a case n0=(1..k) , n1=0 & n2=(1..k) we can't find any solution I guess. Please correct me If I am worng. |
|
0
Good one. |
|
0
Guys I am a noob I need help with this problem 1352F Brinary String construction. ihave read the editorial I am trying a new approach need some help with that . Here's the solution : https://mirror.codeforces.com/contest/1352/submission/80051458 Hope you would help me out. Gracias Lord_Thunder. |
|
0
Auto comment: topic has been updated by lord_thunder (previous revision, new revision, compare). |
|
+3
It'll really help beginners. |
|
0
Happy Fixing u are the best. |
