Cod sursa(job #38176)
Utilizator | Data | 25 martie 2007 15:27:13 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
long long a[10000],n,k,i,sc,ic,pc,sf,max=-100000000000;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
sc=a[1];
ic=pc=sf=1;
for(i=2;i<=n;i++)
{
if(sc>0)
sc=sc+a[i];
else
{
sc=a[i];
pc=i;
}
if(sc>max)
{
max=sc;
ic=pc;
sf=i;
}
}
if(sf-ic>=k)
g<<ic<<" "<<sf<<" "<<max;
return 0;
}