Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- using namespace __gnu_pbds;
- using namespace std;
- #define ff first
- #define ss second
- #define int long long
- #define pb push_back
- #define mp make_pair
- #define pii pair<int,int>
- #define vi vector<int>
- #define mii map<int,int>
- #define pqb priority_queue<int>
- #define pqs priority_queue<int,vi,greater<int> >
- #define setbits(x) __builtin_popcountll(x)
- #define zrobits(x) __builtin_ctzll(x)
- #define mod 1000000007
- #define inf 1e18
- #define ps(x,y) fixed<<setprecision(y)<<x
- #define mk(arr,n,type) type *arr=new type[n];
- #define w(x) int x; cin>>x; while(x--)
- mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
- #define fastio ios_base::sync_with_stdio(0); cin.tie(0);
- int findEarlisetMonth(vector<int> a)
- {
- int n=a.size(),ans_diff,ans_m=0;
- for(int i=1;i<n;i++) a[i]+=a[i-1];
- ans_diff = a[0] - ((a[n-1]-a[0])/(n-1));
- ans_diff=abs(ans_diff);
- ans_m=0;
- for(int i=1;i<=n-2;i++)
- {
- int temp = ((a[i])/(i+1)) - ((a[n-1]-a[i])/(n-i-1));
- temp=abs(temp);
- if(temp<ans_diff){
- ans_diff=temp;
- ans_m=i;
- }
- }
- return ans_m+1;
- }
- int32_t main()
- {
- vector<int> a={1,3,2,3};
- cout<<findEarlisetMonth(a)<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment