Cod sursa(job #1584592)
| Utilizator | Data | 30 ianuarie 2016 12:11:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long int n, v[100000], j, i, s, smax, ci, cj;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
smax=-10000;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n; i++)
{ s=0;
for(j=i; j<=n; j++)
{s=s+v[j];
if(s>smax)
{smax=s;
ci=i;
cj=j;}
}
}
g<<smax<<endl;
g<<ci<<endl;
g<<cj<<endl;
f.close();
g.close();
}
