Cod sursa(job #955819)
Utilizator | Nita Adrian Valentin ScoobyDoo38 | Data | 1 iunie 2013 16:01:37 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
#define inf 0x3f3f3f3f
using namespace std;
int k,i,n,best,max1,end1,beg1,beg,min1,v[50002],s[50002];
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>s[i];
s[i]=s[i-1]+s[i];
}
min1=inf;
max1=-inf;
for(i=k;i<=n;i++)
{
if(s[i-k]<min1)
{
min1=s[i-k];
beg=i-k+1;
}
if(s[i]-min1>max1)
{
max1=s[i]-min1;
beg1=beg;
end1=i;
}
}
g<<beg1<<" "<<end1<<" "<<max1;
return 0;
}