forked from KirarinSnow/Google-Code-Jam
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathB.py
executable file
·32 lines (27 loc) · 761 Bytes
/
B.py
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
#!/usr/bin/env python
#
# Problem: City Tour
# Language: Python
# Author: KirarinSnow
# Usage: python thisfile.py <input.in >output.out
for case in range(int(raw_input())):
n = int(raw_input())
p = [map(int, raw_input().split()) for i in range(n-3)]
w = [[0]*n for i in range(n)]
for i in range(3):
for j in range(i+1, 3):
w[i][j] = 1
for i in range(n-3):
x, y = p[i]
w[x-1][i+3] = 1
w[y-1][i+3] = 1
b = 0
for i in range(2, n)[::-1]:
q = []
for j in range(i):
if w[j][i] > 0:
q.append(j)
x, y = q
b = max(b, w[x][y]+w[x][i]+w[y][i])
w[x][y] = max(w[x][y], w[x][i]+w[y][i])
print "Case #%d: %s" % (case+1, b)