Cod sursa(job #1325024)
| Utilizator | Data | 23 ianuarie 2015 09:22:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
deque <int> v;
int main()
{
int i,mx=0,s=0,n,fi,ok=0,k=0,kmax,x;
f>>n;
v.push_back(0);
for(i=1;i<=n;i++)
{
f>>x;
v.push_back(x);
}
for(i=1;i<=n;i++)
{
s=s+v[i];
k++;
if(s<0)
{
s=0;
k=0;
}
if(s>mx)
{
mx=s;
fi=i;
kmax=k;
}
}
g<<mx<<" "<<fi-kmax+1<<" "<<fi;
return 0;
}
