Cod sursa(job #1255884)
Utilizator | Data | 5 noiembrie 2014 14:09:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n;
int s,x,y,ma,i,j,a[100];
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>a[i];
}
for (i=1;i<=n;i++)
{
s=0;
j=i;
while (j<n)
{
s=s+a[j];
if (s>ma)
{
ma=s;
x=i;
y=j;
}
j=j+1;
}
}
g<<ma<<' '<<x<<' '<<y;
return 0;
}