From 45e06a9b726b80719b94beae86464ac4e83ff306 Mon Sep 17 00:00:00 2001
From: Segcolt <9hmbzr275@mozmail.com>
Date: Fri, 4 Oct 2024 13:54:05 -0300
Subject: [PATCH] Finish the problem

The solution was much simpler than what I expected, I should just accept
that some problems is just brute force...
---
 .../Cards Distribution.cpp                    | 89 ++++++-------------
 1 file changed, 29 insertions(+), 60 deletions(-)

diff --git a/Data Structures and Libraries/Cards Distribution.cpp b/Data Structures and Libraries/Cards Distribution.cpp
index 59923c2..0ff7a25 100644
--- a/Data Structures and Libraries/Cards Distribution.cpp	
+++ b/Data Structures and Libraries/Cards Distribution.cpp	
@@ -69,11 +69,6 @@ auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
     return is;
 }
 
-struct player {
-    int total;
-    list<int> cards;
-};
-
 int main()
 {
     ios::sync_with_stdio(false);
@@ -101,66 +96,40 @@ int main()
         total += cards.back();
     }
 
-    V<player> players(p);
-    int lim = cards.size() / p;
-    int count = 0;
-    size_t now = 0;
-    for (size_t i = 0; i < lim * p;) {
-        for (size_t j = 0; j < lim; j++, i++) {
-            players[now].cards.push_back(cards[i]);
-            players[now].total += cards[i];
+    int amax = 0;
+    int cmax = 1;
+    bool keep = true;
+    for (cmax = 1; keep; cmax++) {
+        amax = 0;
+        size_t pi = 0;
+        size_t i = 0;
+        int now = 0;
+        int count = 0;
+        for (; i < cards.size() && pi < p; i++) {
+            if (now + cards[i] > cmax) {
+                if (now == 0) {
+                    pi = p;
+                    continue;
+                }
+
+                rmax(amax, count);
+                now = 0;
+                count = 0;
+                pi++;
+                i--;
+                continue;
+            }
+
+            now += cards[i];
             count++;
         }
-        now++;
-    }
 
-    while (count < cards.size()) {
-        players[now - 1].cards.push_back(cards[count]);
-        players[now - 1].total += cards[count];
-        count++;
-    }
-
-    size_t i = 1;
-    while (i < p) {
-        int act = max(players[i].total, players[i - 1].total);
-        if (max(players[i - 1].total + players[i].cards.back(), players[i].total - players[i].cards.back()) <= act ||
-            max(players[i].total + players[i - 1].cards.front(), players[i - 1].total - players[i - 1].cards.front()) < act) {
-
-            if (players[i].total + players[i - 1].cards.back() < players[i - 1].total + players[i].cards.front()) {
-                players[i].total += players[i - 1].cards.back();
-                players[i - 1].total -= players[i - 1].cards.back();
-                players[i].cards.push_front(players[i - 1].cards.back());
-                players[i].cards.pop_back();
-            } else {
-                players[i - 1].total += players[i].cards.front();
-                players[i].total -= players[i].cards.front();
-                players[i - 1].cards.push_front(players[i].cards.front());
-                players[i - 1].cards.pop_front();
-            }
+        if (i < cards.size()) {
             continue;
         }
-
-        i++;
+        rmax(amax, count);
+        keep = false;
     }
 
-    int cmax = 0;
-    for (auto &i : players) {
-        rmax(cmax, i.total);
-    }
-
-    int amax = 1;
-    int no = 1;
-    int val = cards[0];
-    for (size_t i = 1; i < cards.size(); i++) {
-        if (val + cards[i] > cmax) {
-            val = cards[i];
-            no = 1;
-        } else {
-            val += cards[i];
-            no++;
-        }
-        rmax(amax, no);
-    }
-
-    cout << amax << ' ' << cmax << '\n';
+    cout << amax << ' ' << cmax - 1 << '\n';
 }