Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- using namespace __gnu_pbds;
- #define T \
- ll rrr; \
- cin >> rrr; \
- for (ll w1 = 0; w1 < rrr; w1++)
- #define cin(vec, a) for (ll i = 0; i < a && cin >> vec[i]; i++)
- #define cout(vec, a) for (ll i = 0; i < a && cout << vec[i] << " "; i++)
- #define MOD 1000000007
- #define PI 3.14159265
- #define ceil(a, b) ((a / b) + (a % b ? 1 : 0))
- #define all(v) v.begin(), v.end()
- #define rall(v) v.rbegin(), v.rend()
- #include <iostream>
- #define INF 1e9
- #define mod 1000000007
- #include <string>
- #define el '\n'
- #define sp ' '
- #define loop(n) for (int i = 0; i < n; i++)
- typedef long long ll;
- #define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
- #define multi_ordered_set tree<ll, null_type, greater_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
- /* ///////////// dsu //////////////
- vector<int> parent;
- vector<int> ran;
- void init(int n)
- {
- parent[n] = n;
- ran[n] = 0;
- }
- int find(int n)
- {
- if (parent[n] == n)
- return n;
- return parent[n] = find(parent[n]);
- }
- void union1(int a, int b)
- {
- a = find(a);
- b = find(b);
- if (a != b)
- {
- if (ran[a] < ran[b])
- swap(a, b);
- parent[b] = a;
- if (ran[a] == ran[b])
- ran[a]++;
- }
- }
- ///////////// dsu //////////////
- */
- /* ///////////// sparse_table //////////////
- vector<vector<ll>> sparse_table;
- int op1(int a, int b, string s)
- {
- if (s == "min")
- return min(a, b);
- else if (s == "max")
- return max(a, b);
- else if (s == "gcd")
- return __gcd(a, b);
- else if (s == "lcm")
- return (a * b) / __gcd(a, b);
- else if (s == "sum")
- return a + b;
- else if (s == "mul")
- return a * b;
- }
- void full(int n, int k, string s)
- {
- for (int i = 1; i < k; i++)
- for (int j = 0; j + (1 << i) <= n; j++)
- sparse_table[i][j] = op1(sparse_table[i - 1][j], sparse_table[i - 1][j + (1 << (i - 1))], s);
- }
- int op2(int l, int r, int k)
- {
- long long sum = 0;
- for (int i = k; i >= 0; i--)
- {
- if ((1 << i) <= r - l + 1)
- {
- sum += sparse_table[i][l];
- l += 1 << i;
- }
- }
- return sum;
- }
- void init1()
- {
- int n, q;
- cin >> n;
- int k = log2(n) + 1;
- sparse_table = vector<vector<ll>>(k, vector<ll>(n, 0));
- for (int i = 0; i < n; i++)
- cin >> sparse_table[0][i];
- full(n, k, "sum");
- cin >> q;
- while (q--)
- {
- int l, r;
- cin >> l >> r;
- int len = r - l + 1;
- int k = log2(len);
- cout << op2(l, r, k) << el;
- }
- }
- ///////////// sparse_table //////////////
- */
- /* ///////////// fenwick_tree //////////////
- class FenwickTree {
- private:
- vector<int> tree;
- int n;
- public:
- FenwickTree(int size) {
- n = size;
- tree.resize(n+1);
- }
- void update(int idx, int val) {
- idx++;
- while (idx <= n) {
- tree[idx] += val;
- idx += idx & (-idx);
- }
- }
- int query(int idx) {
- idx++;
- int sum = 0;
- while (idx > 0) {
- sum += tree[idx];
- idx -= idx & (-idx);
- }
- return sum;
- }
- int rangeQuery(int l, int r) {
- return query(r) - query(l-1);
- }
- };
- /////////// fenwick_tree //////////////
- */
- void sasa()
- {
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- #ifndef ONLINE_JUDGE
- freopen("input4.txt", "r", stdin), freopen("output4.txt", "w", stdout);
- #endif
- }
- ///////////////////////////////////////// code //////////////////////////////////////////////////////////////////////////
- // primes from 1 to 1e7
- vector<ll> v;
- void siv()
- {
- vector<bool> prime(10000001, true);
- for (int p = 2; p * p <= 10000001; p++)
- {
- if (prime[p] == true)
- {
- for (int i = p * p; i <= 10000001; i += p)
- prime[i] = false;
- }
- }
- for (int p = 2; p <= 10000001; p++)
- if (prime[p])
- v.push_back(p);
- }
- void solve()
- {
- ll n, j = 0, sum = 0, mx = 0;
- cin >> n;
- string s;
- // ignore the first line
- cin.ignore();
- getline(cin, s);
- vector<ll> v1;
- for (int i = 0; i < s.size(); i++)
- {
- if (s[i] == ' ' || s[i] == '.')
- {
- v1.push_back(i - j);
- sum += (i - j);
- mx = max(mx, i - j);
- j = i + 1;
- }
- }
- v1.push_back(s.size() - j);
- sum += (s.size() - j);
- mx = max(mx, ll(s.size()) - j);
- // cout << mx << " " << sum << el;
- ll l = mx, r = sum, best = 1;
- while (l <= r)
- {
- ll mid = (l + r) / 2, cnt = 0, ans = 1;
- for (int i = 0; i < v1.size(); i++)
- {
- if (cnt + v1[i] > mid)
- {
- cnt = v1[i];
- ans++;
- }
- else
- cnt += v1[i];
- }
- // cout << mid << " " << ans << " " << cnt << el;
- if (ans <= n)
- {
- best = mid;
- r = mid - 1;
- }
- else
- l = mid + 1;
- }
- cout << best << el;
- }
- int main()
- {
- sasa();
- ll t = 1, i = 1;
- // cin >> t;
- while (t--)
- {
- // cout << "test #" << i << ":\n";
- solve();
- i++;
- if (!t)
- break;
- // cout << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement