[1900] CF1600E 博弈 首尾取数构造严格递增 结论题 分类讨论

Author: EndlessCheng

main/1600-1699/1600E.go

@@ -0,0 +1,29 @@
+package main
+
+import (
+	"bufio"
+	. "fmt"
+	"io"
+)
+
+// github.com/EndlessCheng/codeforces-go
+func CF1600E(_r io.Reader, out io.Writer) {
+	in := bufio.NewReader(_r)
+	var n int
+	Fscan(in, &n)
+	a := make([]int, n)
+	for i := range a {
+		Fscan(in, &a[i])
+	}
+
+	p, q := 1, n-1
+	for ; p < n && a[p-1] < a[p]; p++ {}
+	for ; q > 0 && a[q] < a[q-1]; q-- {}
+	if p&1 > 0 || (n-q)&1 > 0 {
+		Fprint(out, "Alice")
+	} else {
+		Fprint(out, "Bob")
+	}
+}
+
+//func main() { CF1600E(os.Stdin, os.Stdout) }

main/1600-1699/1600E_test.go

@@ -0,0 +1,29 @@
+package main
+
+import (
+	"github.com/EndlessCheng/codeforces-go/main/testutil"
+	"testing"
+)
+
+// https://codeforces.com/problemset/problem/1600/E
+// https://codeforces.com/problemset/status/1600/problem/E
+func TestCF1600E(t *testing.T) {
+	// just copy from website
+	rawText := `
+inputCopy
+1
+5
+outputCopy
+Alice
+inputCopy
+3
+5 4 5
+outputCopy
+Alice
+inputCopy
+6
+5 8 2 1 10 9
+outputCopy
+Bob`
+	testutil.AssertEqualCase(t, rawText, 0, CF1600E)
+}