Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int MAXN = 7000005;
- int S[MAXN], n;
- int main(void) {
- ifstream f("secvsummax.in");
- f >> n;
- for (int i = 1; i <= n; ++ i) f >> S[i];
- int bestSum = -int(2e9), sum = 0, st, dr, idx;
- for (int i = 1; i <= n; ++ i) {
- if (sum < 0)
- sum = S[i], idx = i;
- else
- sum += S[i];
- if (bestSum < sum)
- bestSum = sum, st = idx, dr = i;
- }
- ofstream g("secvsummax.out");
- g << st << " " << dr;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement