Maximum Cyclic Segment Sum by yamaya

{for(;++i%NF;)for(j=s=p=NF;j--;s>m?q=p(m=s):_)s+=p=$((i+j)%NF+1)FS p;$0=q}m=--NF

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page