Cod sursa(job #1641746)
Utilizator | Data | 9 martie 2016 10:27:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long int n,i,j,s,m,p,q;
int a[6000000];
int main()
{
f>>n;
for(i=1;i<n;i++) f>>a[i];
m=a[0];
for(i=1;i<n;i++)
{
s=0;
for(j=i;j<n;j++)
{
s+=a[j];
if(s>m)
{
m=s;
p=i;q=j;
}
}
}
g<<m<<" "<<p<<" "<<q;
g.close();
}