Cod sursa(job #1938503)
Utilizator | Data | 24 martie 2017 20:48:46 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("perle2.in");
ofstream g("perle2.out");
int n,k,s,maxx=-100000;
f>>n>>k;
vector<int> a(n+1,0);
for(int i=1; i<=n; i++)
{
f>>s;
a[i]=a[i-1]+s;
}
for(int i=1; i<=n; i++)
{
for(int j=i; j<=n; j++)
{
s=a[j]-a[i-1]-k*(j-i+1);
if(s>maxx)
{
maxx=s;
}
}
}
g<<maxx;
return 0;
}