Cod sursa(job #2121400)
| Utilizator | Data | 3 februarie 2018 17:29:47 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ssm.in" );
ofstream g("ssm.out");
int main()
{
int N,x;
f>>N;
int best=-int(2e9),si=0,sj=0,sum=0,auxi;
for(int i=1;i<=N;i++)
{
f>>x;
if(sum<0)
{
sum=x;
auxi=i;
}
else
sum+=x;
if(best<sum) best=sum,si=auxi,sj=i;
}
g<<best<<" "<<si<<" "<<sj; ///S[i]-S[j-1]
return 0;
}
