Cod sursa(job #826870)
Utilizator | Data | 1 decembrie 2012 12:38:16 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int main(){
long long s,n,i,nr,max,l1,l2,lr,k;
ifstream in("secv2.in");
ofstream out("secv2.out");
in>>n>>k;
s=0;
l1=1;
l2=1;
max=-1000000000;
for(i=1;i<=n;i++){
in>>nr;
s+=nr;
if(s>max&&i-l1+1>=k){
max=s;
lr=l1;
l2=i;
}
if(s<0){
s=0;
l1=i+1;
}
}
out<<lr<<" "<<l2<<" "<<max;
return 0;
}