Cod sursa(job #2345795)
| Utilizator | Data | 16 februarie 2019 18:02:18 | |
|---|---|---|---|
| Problema | Orase | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int main()
{
int S,i,n,bestsum=-int(2e9),sum=0,ind,first,last;
in>>n;
for (i=1;i<=n;i++)
{
in>>S;
if (sum<0)
{
sum=S;
ind=i;
}
else
sum=sum+S;
if (bestsum<sum)
{
bestsum=sum;
first=ind;
last=i;
}
}
out<<bestsum<<" "<<first<<" "<<last;
return 0;
}
