Sufix Array From MAC

POJ 2774 - Long Long Message

The first Sufix Array problem I did. It's now very easy.

POJ 3294 - Life Forms

The second problem. It has linear solution to get the answer. for i-th character, denote f[i] to be the nearest index that f[i]>i and [i, f[i]] contains at least half DNA, then f[i+1]>=f[i].

POJ 2406 - Power Strings (Using Linear Sufix Array)

The correctness I have make in previous time. The O(nlogn) will get TLE, but the linear sufix array will AC this problem.
Merge branch 'master' of github.com:MissAmour/KrwlngsACMFile

Conflicts:
	AfterACM/POJ/1743.cpp
	AfterACM/POJ/[SA-TLE]2406.cpp
	AfterACM/POJ/[SA-normal]3415.cpp
	AfterACM/POJ/input.txt
	AfterACM/POJ/main