Cod sursa(job #2366300)
| Utilizator | Data | 4 martie 2019 19:25:12 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,i;long long mx=-1000000,s=0;
ifstream f("secv2.in");
ofstream o("secv2.out");
f>>n>>k;
int a[n],p,p2=1;
a[0]=0;
for(i=1;i<=n;i++)
{
f>>a[i];
a[i]=a[i-1]+a[i];
if(a[i]>mx){mx=a[i];p=i;}
}cout<<p<<" "<<mx;
p2=1;
for(i=1;i+k<=p;i++)
{
s=0;
s=a[p]-a[i-1];
if(s>mx)mx=s,p2=i;
}
o<<p2<<" "<<p<<" "<<mx;
return 0;
}
