Cod sursa(job #1584607)
| Utilizator | Data | 30 ianuarie 2016 12:20:08 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long a[30000], s;
int n;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>a[i];
}
int m, x, y;
m=a[1]-1;
for(int i=1; i<=n; i++)
{
s=a[i];
if(s>m)
{
m=s;
x=i;
y=i;
}
for(int j=i+1; j<=n; j++)
{
s+=a[j];
if(s>m)
{
m=s;
x=i;
y=j;
}
}
}
g<<m<<" "<<x<<" "<<y;
return 0;
}
