Pagini recente » Cod sursa (job #282615) | Cod sursa (job #2723566) | Cod sursa (job #2395413) | Cod sursa (job #1853994) | Cod sursa (job #1126838)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,a,b,i,j,x;
long long max1;
int sum[6000000];
int main()
{ f>>n;
for(i=1;i<=n;i++) {f>>x;sum[i]=sum[i-1]+x;}
for(i=1;i<=n;i++)
for(j=1;j<i;j++) if(sum[i]-sum[j]>max1) {max1=sum[i]-sum[j];a=j+1;b=i;}
g<<max1<<' '<<a<<" "<<b<<'\n';
f.close();
g.close();
return 0;
}