Cod sursa(job #1742105)
| Utilizator | Data | 15 august 2016 19:59:54 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int n, A[50100],k;
int main(){
cin >>n>>k>>A[1];
for(int i=2;i<=n;i++){
cin >>A[i];
A[i]+=A[i-1];
}
int st = 1,dr = 1,maxs=-2000000000,mins=0,minp=0;
for(int i = k ;i<=n;i++){
if(A[i]-mins>maxs){
maxs = A[i]-mins;
st = minp+1;
dr = i;
}
if(A[i-k+1]<mins){
minp = i - k + 1;
mins = A[i-k+1];
}
}
cout << st << " " << dr << " " << maxs;
}
