Cod sursa(job #1043566)
Utilizator | Data | 28 noiembrie 2013 18:59:57 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,l,mini,maxi,poz,st,dr,s[50001];
int main()
{
f>>n>>k;
maxi=-1250000000;
for (i=1;i<=n;i++)
{
f>>l;
s[i]=s[i-1]+l;
if (i>=k){
if (mini>=s[i-k]) mini=s[i-k],poz=i-k;
if (s[i]-mini>maxi) maxi=s[i]-mini,st=poz+1,dr=i;
}
}
g<<st<<' '<<dr<<' '<<maxi;
return 0;
}