Cod sursa(job #1638283)
Utilizator | Data | 7 martie 2016 22:17:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
long int n,i,j,s,max,p,q;
int a[60000];
f>>n;
for(i=1;i<n;i++) f>>a[i];
max=a[0];
for(i=1;i<n;i++)
{
s=0;
for(j=i;j<n;j++)
{
s+=a[j];
if(s>max)
{
max=s;
p=i;q=j;
}
}
}
g<<max<<" "<<p<<" "<<q;
g.close();
}