Cod sursa(job #877287)

Utilizator TibixbAndrei Tiberiu Tibixb Data 12 februarie 2013 18:57:54
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.4 kb
#include<fstream>
using namespace std;
int p, u, i, n, s[6000002], x, s1, sf;
int main(){
    ifstream f("ssm.in");
    ofstream g("ssm.out");
    f>>n;
    for(i=1; i<=n; i++){
        f>>x;
        s[i]+=s[i-1]+x;
    }
    for(p=1; p<=n-1; p++)
        for(u=p+1; u<=n; u++){
            s1=s[u]-s[p-1];
            if(s1>sf)
                sf=s1;
        }
    g<<sf;
return 0;
}