Cod sursa(job #1060047)
| Utilizator | Data | 17 decembrie 2013 15:46:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, nr, s[6000001], mini=10000000, pmin, p1, p2, i, maxi=-100000;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>nr;
s[i]=s[i-1]+nr;
if(s[i]<mini)
{
mini=s[i];
pmin=i;
}
if(s[i]-mini>maxi)
{
maxi=s[i]-mini;
p1=pmin+1;
p2=i;
}
}
g<<maxi<<" "<<p1<<" "<<p2;
f.close();
g.close();
return 0;
}
