This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl "\n"
#define sz = s.size()
using ll = long long;
const int Z = 1e6+9;
const int INF = 1e9+9;
const int mod = 1e9+7;
using namespace std;
ll a[555555];
ll x, n, mn, mx, sum, ans, dif, t, k ;
int main()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i] ;
ll l = 0, r = n - 1 ;
while (l != r){
if (l == r - 1 && a[l] == a[r]) break ;
if (a[l] == a[r]){
l++;
r--;
}
else{
if (a[l] < a[r]){
a[l+1] += a[l] ;
l++ ;
ans++ ;
}
else{
a[r-1] += a[r] ;
r-- ;
ans++ ;
}
}
}
///for (int i = 0 ; i < n; i++) cout << a[i] << " " ;
cout << ans << endl;
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |