# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109893 | 2024-11-08T02:53:53 Z | ozner77 | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int besthub(int R,int L,int X[],int B){ long long ans=0; long long con=0; long long con2=0; vector<long long> V; V.push_back(0); for(int i=1;i<=L;i++){ if(X[con2]=i){ V.push_back(X[con2]); }else{ V.push_back(0); } } for(int i=1;i<=B;i++){ if(X[con]==i){ ans+=X[con]; con++; } } long long maxsum=ans; long long res=1; for(int i=B+1;i<=L;i++){ ans=ans-V[i-B]; ans=ans+V[i]; if(ans>maxsum){ maxsum=ans; res=i; } } return res; }