Cod sursa(job #1155599)
Utilizator | Data | 27 martie 2014 00:36:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
long long n,v[100002],i,j,smax=0,i1,i2;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i],v[i]+=v[i-1];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[j]-v[i-1]>smax) smax=v[j]-v[i-1],i1=i,i2=j;
g<<smax<<i1<<' '<<i2;
f.close();g.close();
return 0;
}