Cod sursa(job #480754)
| Utilizator | Data | 29 august 2010 14:32:26 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,x,v[50001],maxim=-1<<32,minim,in,sf,poz;
int main()
{
int i;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>x;
v[i]=v[i-1]+x;
if(maxim<v[i]-minim&&i-poz>=k)
{
maxim=v[i]-minim;
in=poz+1;
sf=i;
}
if(v[i]<minim&&n-i+1>=k)
{
minim=v[i];
poz=i;
}
}
g<<in<<" "<<sf<<" "<<maxim;
return 0;
}
