Cod sursa(job #1779056)
Utilizator | Data | 14 octombrie 2016 18:46:43 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
long long n,k,i,a,j,mini,maxi,start,stop,s[50005];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1; i<=k; i++)
{
f>>a;
s[i]=s[i-1]+a;
}
for(i=1; i+k<=n; i++)
{
f>>a;
s[i+k]=a+s[i+k-1];
if(mini>s[i]) {mini=s[i]; j=i;}
if(s[i+k]-mini>maxi)
{
maxi=s[i+k]-mini;
start=j+1;
stop=i+k;
}
}
g<<start<<" "<<stop<<" "<<maxi<<'\n';
f.close(); g.close();
return 0;
}