Cod sursa(job #453441)
| Utilizator | Data | 11 mai 2010 00:21:45 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ofstream g("secv2.out");
int i,j,n,m,k,a[50001],ic,sf,max2=0,s1,intx,b[50001];
int det(int x)
{
int s=0,max1=-250000;
for(j=x;j<=n;j++)
{
s+=a[j];
if(s>max1&&j-x>=k)
{
max1=s;
b[x]=j;
}
}
return max1;
}
int main()
{
ifstream f("secv2.in");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
max2=det(1);
for(i=2;i<=n;i++)
if(det(i)>max2)
{
max2=det(i);
ic=i;
}
g<<ic<<" "<<b[ic]<<" "<<max2;
return 0;
}