Răspuns:
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
void solve() {
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
int temp = -1;
while (true) {
cnt++;
int maxi = INT_MIN;
for(int i = 0; i < n; i++) {
int n = a[i], sum = 0;
while (n >= 10) {
sum+=n%10;
n/=10;
}
sum+=n;
if (sum > maxi) {
maxi = sum;
}
}
int na = -1, ma = -1;
bool f = false;
for(int i = 0; i < n; i++) {
int n = a[i], sum = 0;
while (n >= 10) {
sum+=n%10;
n/=10;
}
sum+=n;
if (sum == maxi && !f) {
f = true;
na = i;
}
}
f = false;
for(int i = n-1; i >= 0; i--) {
int n = a[i], sum = 0;
while (n >= 10) {
sum+=n%10;
n/=10;
}
sum+=n;
if (sum == maxi && !f) {
f = true;
ma = i;
}
}
int cnt1 = 0;
for (int i = na; i <= ma; i++) {
a[i] = -1;
cnt1++;
}
if (temp != -1) {
if (cnt1 > temp) {
temp = cnt1;
}
} else {
temp = cnt1;
}
bool d = false;
for (int i = 0; i < n; i++) {
if (a[i] != -1) {
d = false;
break;
} else {
d = true;
}
}
if(d) {
break;
}
}
cout << cnt << " " << temp;
}
int main() {
solve();
}
