Cod sursa(job #1005177)
| Utilizator | Data | 4 octombrie 2013 14:00:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define Nmax 100000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,K,v[Nmax],beg,start,finish;
long long S=-999999999999,sum;
inline void ReadInput()
{
f>>N>>K;
for(int i=1;i<=N;i++)f>>v[i];
}
int main()
{
ReadInput();
for(int i=1;i<=N;i++)
{
if(sum+v[i]>=v[i])sum+=v[i];
else sum=v[i],beg=i;
if(sum>S)
{
S=sum;
start=beg;
finish=i+1;
}
}
g<<S<<' '<<start<<' '<<finish<<'\n';
f.close();g.close();
return 0;
}
