Cod sursa(job #572038)
Utilizator | Moldovan Liliana lily3 | Data | 4 aprilie 2011 23:04:08 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int i,n,a[50005],max1,ic,sf,k,x,min1;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
min1=20000000;
for(i=1;i<=n;i++)
f>>x,a[i]=a[i-1]+x;
max1=-20000000;
for(i=k;i<=n;i++)
{
if(a[i-k]<min1)
{
min1=a[i-k];
ic=i-k+1;
}
if(a[i]-min1>max1)
{
max1=a[i]-min1;
sf=i;
}
}
g<<ic<<" "<<sf<<" "<<max1<<"\n";
return 0;
}