Cod sursa(job #921290)

Utilizator MIonutMistreanu Ionut MIonut Data 20 martie 2013 21:36:40
Problema Subsecventa de suma maxima Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
vector<int>v;
vector<int>s;
int n, smax=-1<<31, l2, l1;
void citire()
{
    f>>n;
    for(int x, i=0; i<n; ++i)
    {
        f>>x;
        v.push_back(x);
        s.push_back(0);
    }
}
int main()
{
    citire();
    for(int i=0; i<s.size()-1; ++i)
    {
        s[i]=v[i];
        if(s[i]>smax)
        {
            smax=s[i];
            l1=l2=i;
        }
        if(v[i]>=0)
        {
            for(int j=i+1; j<s.size(); ++j)
            {
                s[j]=s[j-1]+v[j];
                if(s[j]==smax && l2-l1>j-i)
                {
                    smax=s[j];
                    l1=i;
                    l2=j;
                }
                else if(s[j]>smax)
                {
                    smax=s[j];
                    l1=i;
                    l2=j;
                }
            }
        }
    }
    g<<smax<<" "<<l1+1<<" "<<l2+1<<'\n';
    g.close();
    return 0;
}