1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; long long a[1000005]; long long n,m,xx,yy,k,ans; long long f(long long h) { long long g=0; for(int i=1;i<h;i++) g=g+a[i]*(h-i); for(int i=h+1;i<=n;i++) g=g+a[i]*(i-h); return g; } int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; ans+=a[i]; } ans/=2; for(long long i=1;i<=n;i++) { k+=a[i]; if(k>=ans) { xx=i-1,yy=i; break; } } long long x=f(xx),y=f(yy); if(x>y) cout<<y<<' '<<yy; else cout<<x<<' '<<xx; return 0; }
- 1
Information
- ID
- 742
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- (None)
- # Submissions
- 2
- Accepted
- 1
- Uploaded By