Cod sursa(job #451819)
Utilizator | Data | 9 mai 2010 23:05:37 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int i,j,n,m,k,a[50001],ic,sf,max1=0,s1,intx;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(s1<0)
{
s1=a[i];
intx=i;
}
else
s1+=a[i];
if(max1<s1&&i-intx>=k)
{
max1=s1;
ic=intx;;
sf=i;
}
}
g<<ic<<" "<<sf<<" "<<max1;
return 0;
}