Cod sursa(job #1571791)
| Utilizator | Data | 18 ianuarie 2016 15:18:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long x,dp[6000000], Min=(int)(2e9), Max=-(int)(2e9), s=0,p1,p2, n;
int main()
{
in>>n;
in>>x;
s=x;
p1=p2=1;
for(int i=2;i<=n;i++)
{
in>>x;
s+=x;
if (s<0)
{
s=0;
p1=p2=i+1;
}
if(s>Max)
{
Max=s;
p2=i;
}
}
out<<Max<< " "<<p1 << " "<<p2;
return 0;
}
