package main import ( "bufio" "fmt" "os" "strconv" ) func configure(scanner *bufio.Scanner) { scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) } func getNextString(scanner *bufio.Scanner) string { scanned := scanner.Scan() if !scanned { panic("scan failed") } return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout extra := 0 if os.Getenv("I") == "IronMan" { fp, _ = os.Open(os.Getenv("END_GAME")) extra = 100 } scanner := bufio.NewScanner(fp) configure(scanner) writer := bufio.NewWriter(wfp) defer func() { r := recover() if r != nil { fmt.Fprintln(writer, r) } writer.Flush() }() solve(scanner, writer) for i := 0; i < extra; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) s := getNextInt(scanner) - 1 t := getNextInt(scanner) - 1 aa := make([]int64, n) ss := make([]int64, n+1) for i := 0; i < n; i++ { aa[i] = getNextInt64(scanner) ss[i+1] = ss[i] + aa[i] } if s < t { r := (s + t) >> 1 l := r - (n+1)>>1 if (t-s)%2 == 0 { if t-r+1 > n>>1 { fmt.Fprintln(writer, calc(l+1, r+1, ss)*2-ss[n]) return } fmt.Fprintln(writer, max(calc(l, r, ss), calc(l+1, r+1, ss))*2-ss[n]) return } fmt.Fprintln(writer, calc(l+1, r+1, ss)*2-ss[n]) return } l := (s + t) >> 1 r := l + (n+1)>>1 if (s-t)%2 == 0 { if l-t > n>>1 { fmt.Fprintln(writer, calc(l, r, ss)*2-ss[n]) return } fmt.Fprintln(writer, max(calc(l, r, ss), calc(l+1, r+1, ss))*2-ss[n]) return } if l == t { fmt.Fprintln(writer, calc(l+1, r+1, ss)*2-ss[n]) return } fmt.Fprintln(writer, calc(l, r, ss)*2-ss[n]) } func calc(l, r int, ss []int64) int64 { if l < 0 { return ss[r] + ss[len(ss)-1] - ss[len(ss)-1+l] } if r >= len(ss) { return ss[len(ss)-1] - ss[l] + ss[r%len(ss)+1] } return ss[r] - ss[l] } func max(a, b int64) int64 { if a < b { return b } return a }