Cod sursa(job #850633)
| Utilizator | Data | 8 ianuarie 2013 18:19:28 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
long n,k,x,poz,max1,min1,sf,in,i,a[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>x;
a[i]=a[i-1]+x;
}
for(i=k;i<=n;i++)
{
if(min1>a[i-k])
{
min1=a[i-k];
poz=i-k+1;
}
if(max1<a[i]-min1)
{
max1=a[i]-min1;
in=poz;
sf=i;
}
}
g<<in<<" "<<sf<<" "<<max1;
}
