Cod sursa(job #1337919)
| Utilizator | Data | 9 februarie 2015 17:15:15 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
int s[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,i,j=1,sc=-1,smax=-2000000000,k=1,h=1,t;
f>>n>>t;
for(i=1;i<=n;i++)
{
f>>s[i];
if(sc<0)
{
sc=0;
k=i;
}
sc+=s[i];
if(sc>smax && (i-k)>=t)
{
smax=sc;
j=i;h=k;
}
}
if(k==n)
{
smax=0;
for(i=1;i<=n;i++)
smax+=s[i];
g<<"1 "<<n<<" "<<smax;
}
else
g<<h<<" "<<j<<" "<<smax;
f.close();
g.close();
return 0;
}
