Cod sursa(job #1405100)
| Utilizator | Data | 28 martie 2015 20:46:52 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define MAX 2000000000
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
int Min,Max,k,n,i,s[50005],pi,pf;
int main()
{
f>>n>>k;
Min=MAX;
Max=-MAX;
for (i=1;i<=n;++i)
{
f>>s[i];
s[i]+=s[i-1];
if (i>=k)
{
if (s[i-k]<Min)
{
Min=s[i-k];
pi=i-k;
}
if (s[i]-Min>Max)
{
Max=s[i]-Min;
pf=i;
}
}
}
g<<pi+1<<' '<<pf<<' '<<Max;
return 0;
}
