Cod sursa(job #1554364)
| Utilizator | Data | 21 decembrie 2015 12:19:56 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int n,i,v[50001],k,s[50001],p,u,maxim,minim,pmax;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int main (){
fin>>n>>k;
for (i=1;i<=n;i++){
fin>>v[i];
s[i] = s[i-1] + v[i];
}
minim = 1000000000;
for (i=k;i<=n;i++){
if (s[i-k] < minim){
minim = s[i-k];
p = i-k;
}
if (s[i]-minim > maxim){
maxim = s[i]-minim;
u = i;
pmax = p;
}
}
fout<<pmax+1<<" "<<u<<" "<<maxim;
return 0;
}
