Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main (){
- long long n, s=0, mx=-1, k;
- cin >> n;
- vector<long long> a(n);
- vector<long long> p(n+1);
- vector<long long> m(n+1);
- for (int i=1; i<=n; i++){
- cin >> a[i-1];
- p[i]=a[i-1]+p[i-1];
- }
- for (int i=0; i<=n; i++)
- cin >> m[i];
- for (int i=0; i<n; i++){
- if (p[min(m[i]+i, n)]-p[i] >=mx){
- mx=p[min(m[i]+i, n)]-p[i];
- k=i;
- }
- }
- if (mx==0)
- cout << 0;
- else
- cout << mx << ' ' << k;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement