Cod sursa(job #1814850)
Utilizator | Chira Cristian Cristi_Chira | Data | 24 noiembrie 2016 16:58:18 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <climits>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
typedef int v[100000];
v a;
int main()
{ int i, n, j, contor=2, s=0, maxim=INT_MIN, imax, jmax;
f>>a[0];
for(i=1; i<=a[0]; i++)
{
f>>a[i];
}
for(contor=1; contor<=a[0]-1; contor++)
{
for(i=1; i<a[0]-contor+2; i++)
{ s=0;
for(j=i; j<=i+contor-1; j++)
{
s=s+a[j];
}
if(s>maxim){
maxim=s;
imax=i;
jmax=j;
}
}
}
g<<maxim<<" "<<imax<<" "<<jmax-1;
return 0;
}