Segcolt/Beecrowd-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Actually do the problem

Browse Source 
I completely forgot to commit this one...
This commit is contained in:
Segcolt 2024-11-02 16:27:53 -03:00
parent 92daea9371
commit e6bcb6f654
1 changed files with 3 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
Data Structures and Libraries/Cards Distribution.cpp
View File

@ -87,7 +87,7 @@ int main()
} }
vi cards; vi cards;
ll total = 0; int total = 0;
while (n--) { while (n--) {
string a; string a;
@ -96,23 +96,10 @@ int main()
total += cards.back(); total += cards.back();
} }
size_t i = 0; int cmax = max(cards[0], total / p);
size_t j = 0;
int cmax = 0;
int now = 0;
while (j < cards.size()) {
if (total - now < now) {
now -= cards[i];
i++;
continue;
}
now += cards[j];
j++;
rmax(cmax, now);
}
int amax = 0; int amax = 0;
now = 0; int now = 0;
int num = 0; int num = 0;
for (auto i : cards) { for (auto i : cards) {
if (now + i > cmax) { if (now + i > cmax) {