Cod sursa(job #1346372)
Utilizator | Data | 18 februarie 2015 10:48:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
int main ()
{
int maxim=0; int suma=0;
int p, u; int x;
int ct=0;
p=1;
int pp, uu;
f>>n;
while(n!=0)
{
f>>x; ct++;
suma+=x;
if(suma<0)
{
suma=0;
p=ct+1;
}
if(suma>maxim)
{
maxim=suma;
pp=p;
uu=ct;
}
n--;
}
g<<maxim<<' '<<pp<<' '<<uu;
}