Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- const int MAX_N = 100000;
- using namespace std;
- long long score[MAX_N+1];
- long long suffix_sum[MAX_N+1];
- long long suffix_min[MAX_N+1];
- long long best_num, best_den;
- int main(void)
- {
- ifstream fin ("homework.in");
- ofstream fout ("homework.out");
- int N;
- fin >> N;
- for (int i=1; i<=N; i++)
- fin >> score[i];
- suffix_sum[N] = score[N];
- suffix_min[N] = score[N];
- for (int i=N-1; i>=1; i--) {
- suffix_sum[i] = suffix_sum[i+1] + score[i];
- suffix_min[i] = min(suffix_min[i+1], score[i]);
- }
- best_num = 0;
- best_den = 1;
- for (int i=1; i<=N-2; i++)
- if ((suffix_sum[i+1]-suffix_min[i+1]) * best_den > best_num * (N-i-1)) {
- best_num = suffix_sum[i+1]-suffix_min[i+1];
- best_den = N-i-1;
- }
- for (int i=1; i<=N-2; i++)
- if ((suffix_sum[i+1]-suffix_min[i+1]) * best_den == best_num * (N-i-1))
- fout << i << "\n";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
