Cod sursa(job #1161248)
| Utilizator | Data | 31 martie 2014 09:31:27 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,j,n,k,x,y,M;
int v[50001];
int main()
{
f>>n>>k;
for (i=1;i<=n;++i)
f>>v[i],v[i]+=v[i-1];
int st=1,dr=k;
while (dr<=n)
{
if (v[dr]-v[st-1]<0)
++st,dr-st<k-1?++dr:1;
else ++dr;
if (v[dr]-v[st-1]>M)
M=v[dr]-v[st-1],x=st,y=dr;
}
g<<x<<" "<<y<<" "<<M;
return 0;
}
