forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgowithflow.cpp
112 lines (89 loc) · 2.26 KB
/
gowithflow.cpp
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <bits/stdc++.h>
using namespace std;
void findspaces(vector<vector<int>>& out, vector<int>& lengths, int width) {
out.push_back({});
int currlen = 0;
for(auto& i : lengths) {
if(currlen + i > width) {
out.push_back({});
currlen = 0;
}
currlen += i;
out.back().push_back(currlen);
currlen++;
}
for(auto& i : out) {
if(i.size() > 0) {
i.pop_back();
}
}
}
int riverlength(vector<vector<int>>& spaces) {
int best = 0;
int biggest = 0;
for(auto& i : spaces) {
biggest = max(biggest, i.back());
}
biggest += 2;
vector<int> updated(biggest, -2);
vector<int> prevval(biggest, 0);
int ct = 0;
for(auto& line : spaces) {
for(auto& space : line) {
int val = 1;
for(int i = -1; i <= 1; i++) {
if(updated[space+i]+1 < ct) {
prevval[space+i] = 0;
updated[space+i] = ct;
}
val = max(val, prevval[space+i]+1);
}
prevval[space] = val;
updated[space] = ct;
best = max(best, val);
}
ct++;
}
return best;
}
int main() {
int n;
cin >> n;
vector<int> v;
int longest = 0;
int total = 0;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
v.push_back(s.size());
longest = max(longest, (int)s.size());
total += s.size() + 1;
}
int idx = 0;
int river = -1;
vector<vector<int>> old;
for(int i = longest; i < total; i++) {
vector<vector<int>> spaces;
findspaces(spaces, v, i);
bool same = true;
if(old.size() == spaces.size()) {
for(int i = 0; i < old.size(); i++) {
if(old[i].size() != spaces[i].size()) {
same = false;
}
}
if(same) continue;
}
old = spaces;
int var = spaces.size();
if(var <= river) {
break;
}
int riverhere = riverlength(spaces);
if(riverhere > river) {
river = riverhere;
idx = i;
}
}
cout << idx << " " << river << endl;
}