Cod sursa(job #1901989)
Utilizator | Farauanu Ionut Skiry | Data | 4 martie 2017 12:32:10 |
---|---|---|---|
Problema | Secventa 2 | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,el,poz,fin,maxim;
vector <int> a;
int main()
{
f>>n>>k;
for(i=0;i<n;i++)
{
f>>el;
a.push_back(el);
if(i) a[i]+=a[i-1];
}
for(i=k;i<n;i++)
for(j=0;j<=i-k;j++)
if(a[i]-a[j]>maxim) maxim=a[i]-a[j],poz=j+1,fin=i;
g<<poz+1<<" "<<fin+1<<" "<<maxim;
return 0;
}