Created
February 1, 2019 14:26
-
-
Save leynier/fcf4145e14531d99a6882ea449f15a15 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
int main() { | |
int n; | |
while (cin >> n) { | |
int mn = 0; | |
vector<int> list; | |
for (int i = 0; i < n; ++i) { | |
string s; | |
cin >> s; | |
list.push_back(s.size()); | |
mn = max(mn, list.back()); | |
} | |
int ret = 0; | |
int retw = -1; | |
for (int w = mn;; ++w) { | |
vector<int> cur(w); | |
vector<int> next(w); | |
int cs = -1, nline = 1; | |
for (int vi = 0; vi < list.size(); ++vi) { | |
if (cs + list[vi] >= w) { | |
cur.swap(next); | |
next = vector<int>(w); | |
cs = -1; | |
++nline; | |
} | |
if (cs >= 0) { | |
next[cs] = max(cur[cs - 1] + 1, max(cur[cs] + 1, cur[cs + 1] + 1)); | |
if (next[cs] > ret) { | |
ret = next[cs]; | |
retw = w; | |
} | |
} | |
cs += list[vi] + 1; | |
} | |
if (ret >= nline) | |
break; | |
} | |
cout << retw << " " << ret << endl; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment