Cod sursa(job #1082815)
| Utilizator | Data | 14 ianuarie 2014 22:22:22 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int v[500001];
int s[500001];
int main()
{
int n, k, smax, sum, ic, jc, j, i;
in>>n;
in>>k;
s[0]=0;
for(j=1; j<=n;j++)
{
in>>v[j];
s[j]=s[j-1]+v[j];
}
i=1;
smax=s[k];
ic=1;
jc=k;
for(j=k+1; j<=n; j++)
{
if(s[i]>s[j-k-1])
i=j-k-1;
sum=s[j]-s[i];
if(sum>smax)
{
smax=sum;
ic=i+1;
jc=j;
}
}
out<<ic<<" "<<jc<<" "<<smax;
return 0;
}
