Cod sursa(job #2173181)
| Utilizator | Data | 15 martie 2018 21:01:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <cstdio>
#include <climits>
using namespace std;
int n, i, s, sum, bestSum=-INT_MAX, x1, x2, y;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++)
{
scanf("%d", &s);
if(sum<0)
{
sum=s;
x1=i;
}
else
sum+=s;
if(bestSum<sum)
{
bestSum=sum;
x2=x1;
y=i;
}
}
printf("%d %d %d", bestSum, x2, y);
fclose(stdin);
fclose(stdout);
return 0;
}
