sut_ningwei

摘要： 我是如此水，学校如此水。。。有的时候错过就是错过了，再也不会回来。不要认输，因为你的对手可能很垃圾。视野要开阔附D水代码#include <iostream>#include <algorithm>using namespace std;struct rect{ long long area; int u, d, l, r; long long get(int y0, int y1, int x0, int x1) { u = max(y0, y1); d = min(y0, y1); l = min(x0, x1); r = max(x0, x1); area = ( 阅读全文

摘要： #include<stdio.h>int main(){ int s, e, t, n, i, j, nn, a[3][128], r[128], p[3]; scanf("%d", &t); while (t--) { p[0] = p[1] = p[2] = 0; scanf("%d", &n); for (i = 0; i < 3; i++) { scanf("%d", &nn); for (j = 0; j < nn; j++) scanf("%d", &am 阅读全文

摘要： 查看不能折叠的水代码#include<stdio.h>struct{ int s, e; long long int s1, s2;} x[262144];void set(int s, int e, int t){ x[t].s = s; x[t].e = e; if (s != e) { set(s, (s + e) >> 1, (t << 1) + 1); set(((s + e) >> 1) + 1, e, (t << 1) + 2); }}long long int CQ(int s, int e, long lo... 阅读全文

摘要： View Code 1 #include<stdio.h> 2 3 int main() 4 { 5 int m, n, k[11][11], t; 6 k[0][0] = 1; 7 for (m = 0; m < 11; m++) 8 { 9 k[m][1] = 1;10 for (n = 2; n <= m; n++)11 k[m][n] = k[m][n - 1] + k[m - n][n];12 while (n < 11)13 k[m][n++] = k... 阅读全文

摘要： View Code 1 #include<stdio.h> 2 3 int main() 4 { 5 int n, i, j, a, dp[128] = { 0 }; 6 scanf("%d", &n); 7 i = n; 8 while (i--) 9 {10 for (j = i; j < n; j++)11 {12 scanf("%d", &a);13 dp[j] = (dp[j] > dp[j + 1]) ? dp[j] + a : dp[j + 1] + a;1... 阅读全文