Cod sursa(job #1347642)
| Utilizator | Data | 19 februarie 2015 04:43:04 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
int s[100000];
int main()
{
ifstream in("secv2.in");
ofstream out("secv2.out");
int i,n,k,sumamax,minim=20000000,x,y,loc;
in>>n;
in>>k;
for (i=1;i<=n;i++)
{
in>>s[i];
s[i]+=s[i-1];
}
x=1;
y=k;
sumamax=s[k];
for (i=k+1;i<=n;i++)
{
if (s[i-k]<minim)
{
minim=s[i-k];
loc=i-k;
}
if (s[i]-minim>sumamax)
{
sumamax=s[i]-minim;
x=loc+1;
y=i;
}
}
out<<x<<" "<<y<<" "<<sumamax;
}
