Cod sursa(job #1361324)
Utilizator | Data | 25 februarie 2015 20:42:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,i,j,k,s,v[500000],lg,poz,smax=0;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++)
for(j=i , s=0; j<=n; j++)
{
s += v[j];
if(s>smax)
{
poz = i;
lg = j;
smax= s;
}
}
g<<smax<<" "<<poz<<" "<<lg;
return 0;
}