## Atcoder 88 D-Wide Flip

Time limit : 2sec / Memory limit : 256MB You are given a string $S$ consisting of 0 and 1. Find the maximum integer $K$ not greater than $|S|$ such that we can turn all the characters of $S$ into 0 by repeating the following operation some number of times. Choose a contiguous segment $[l,r]$ in $S$ whose length is at least $K$ (that is,$r-l+1\geq K$ must be satisfied). For each integer $i$ such that $l\leq i\leq r$, do the following: if $S_i$ is 0, replace it with 1; if $S_i$ is 1, replace it with 0. （更多…）

## HDU 6242 Geometry Problem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Alice is interesting in computation geometry problem recently. She found a interesting problem and solved it easily. Now she will give this problem to you : You are given $N$ distinct points $(X_i,Y_i)$ on the two-dimensional plane. Your task is to find a point $P$ and a real number $R$, such that for at least $⌈\frac{N}{2}⌉$ given points, their distance to point $P$ is equal to $R$. （更多…）

（更多…）

## bilibili提醒姬

### bilibili-live reminder

• PC: python3.6.2, windows 10 x64 1709
• Cloud Server: centOS 7.2 x64, python3.5 （更多…）