Cod sursa(job #1912713)
| Utilizator | Data | 8 martie 2017 10:18:44 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
const int N=100005;
int v[N];
int main()
{
int n,k,poz=0,Max,st=1,dr;
in>>n>>k;
dr=k;
for(int i=1;i<=n;i++){
in>>v[i];
v[i]+=v[i-1];
}
Max=v[k];
in.close();
for(int i=k+1;i<=n;i++){
if(v[i-k]<v[poz])
poz=i-k;
if(v[i]-v[poz]>Max){
Max=v[i]-v[poz];
st=poz+1;
dr=i;
}
}
out<<st<<" "<<dr<<" "<<Max<<"\n";
out.close();
return 0;
}
