huanghai
/
python
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

'commit'

Browse Source
main
黄海 2 years ago
parent 236a0b72a5
commit 91118b677c
2 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File

3
TangDou/Topic/PrefixAndSuffix/P1115_Prefix.cpp
Unescape View File

@ -1,7 +1,6 @@
#include <bits/stdc++.h> #include <bits/stdc++.h>
using namespace std; using namespace std;
const int N = 200100; const int N = 200100;
const int INF = 0x3f3f3f3f;
int n, a[N], s[N], ans[N]; int n, a[N], s[N], ans[N];
int main() { int main() {
@ -14,7 +13,7 @@ int main() {
ans[i] = s[i] - mi; ans[i] = s[i] - mi;
mi = min(mi, s[i]); mi = min(mi, s[i]);
} }
int res = -INF; int res = INT_MIN;
for (int i = 1; i <= n; i++) res = max(res, ans[i]); for (int i = 1; i <= n; i++) res = max(res, ans[i]);
cout << res << endl; cout << res << endl;
return 0; return 0;

3
TangDou/Topic/【前缀和与差分】题单.md
Unescape View File

@ -27,7 +27,6 @@
#include <bits/stdc++.h> #include <bits/stdc++.h>
using namespace std; using namespace std;
const int N = 200100; const int N = 200100;
const int INF = 0x3f3f3f3f;
int n, a[N], s[N], ans[N]; int n, a[N], s[N], ans[N];
int main() { int main() {
@ -40,7 +39,7 @@ int main() {
ans[i] = s[i] - mi; ans[i] = s[i] - mi;
mi = min(mi, s[i]); mi = min(mi, s[i]);
} }
int res = -INF; int res = INT_MIN;
for (int i = 1; i <= n; i++) res = max(res, ans[i]); for (int i = 1; i <= n; i++) res = max(res, ans[i]);
cout << res << endl; cout << res << endl;
return 0; return 0;

Write Preview
Loading…
Cancel
Save