Cod sursa(job #2176212)
| Utilizator | Data | 16 martie 2018 21:36:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN=7000005;
///subsecventa de suma maxima
int i,j;
int s[MAXN],n;
int bestsum=std::numeric_limits<int>::min(),idx,inceput,sfarsit,sum;
int main()
{
f>>n;
for(i=1; i<=n ; i++)f >> s[i];
for (i=1; i<=n; i++)
{
if(sum<0)sum=s[i],idx=i;
else sum+=s[i];
if(bestsum<sum)bestsum=sum,inceput=idx,sfarsit=i;
}
g<<bestsum<<" "<<inceput<<" "<<sfarsit<<endl;
return 0;
}
