NowCoder/tmp.py at master · tcoln/NowCoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
import sys
N = input()
maxp = 0
bestm = 0

def mind(pos, m):
    l = len(pos)
    mindis = l
    for i in range(l):
        if pos[i] == 1 and abs(i-m) < mindis:
            mindis = abs(i-m)
    return -1 if mindis in [1,l] else mindis

def goodm(pos):
    l = len(pos)
    maxdis = 1
    goodi = -1
    for i in range(l):
        if pos[i] == 0:
            mindis = mind(pos, i)
            if mindis > maxdis:
                maxdis = mindis
                goodi = i
    return goodi

def gogo(pos, m):
    nextm = m
    p = 0
    while nextm != -1:
        import sys
N = input()
maxp = 0
bestm = 0

def mind(pos, m):
    l = len(pos)
    mindis = l
    for i in range(l):
        if pos[i] == 1 and abs(i-m) < mindis:
            mindis = abs(i-m)
    return -1 if mindis in [1,l] else mindis

def goodm(pos):
    l = len(pos)
    maxdis = 1
    goodi = -1
    for i in range(l):
        if pos[i] == 0:
            mindis = mind(pos, i)
            if mindis > maxdis:
                maxdis = mindis
                goodi = i
    return goodi

def gogo(pos, m):
    nextm = m
    p = 0
    while nextm != -1:
        pos[nextm] = 1
        nextm = goodm(pos)
        p += 1
    return p

for m in range(N):
    pos = [0]*N
    p = gogo(pos, m)
    if p > maxp:
        maxp = p
        bestm = m
print maxp, bestm+1
        nextm = goodm(pos)
        p += 1
    return p

for m in range(N):
    pos = [0]*N
    p = gogo(pos, m)
    if p > maxp:
        maxp = p
        bestm = m
print maxp, bestm+1