Cod sursa(job #1044737)

Utilizator Mitsa3Neamt Mihai Mitsa3 Data 30 noiembrie 2013 11:57:10
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.73 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
#define maxn 50005
#define INF 0x3f3f3f3f
int s[maxn],a[maxn],mn[maxn],poz[maxn];
void sume_part(int a[], int n)
{
    for( int i = 1; i <= n; i++)
        s[i]=a[i]+s[i-1];
}

int main()
{
    int n,k;
    fin >> n >> k;
    for( int i = 1; i <= n; i++)
        fin >> a[i];
    sume_part(a,n);

    int x,y,smin=INF,smax=-INF;
    for( int i = k; i<=n; i++)
    {
        if(smin>s[i-k]){
            smin=s[i-k];
            x=i=k;
        }
        if(s[i]-smin>smax){
            smax=s[i]-smin;
            y=i;
        }
    }
    fout << x << " " << y << " " << smax << "\n";
    return 0;
}