目录 Ural 1248 Sequence Sum 题解 题意 题解 程序 Ural 1248 Sequence Sum 题解 题意 给定\(n\)个用科学计数法表示的实数\((10^{-100}\sim10^{100})\),输出它们的和. Tip: 一个实数可以用科学计数法表示为\(x\times10^y\),其中\(1\le x<10\) \(x\)为实数,\(y\)是整数.输入时表示为\(xey\).保证输入的实数有\(19\)位有效数字.输出时用科学计数法,必须包括\(19\)位正确数…

Sequence Sum Possibilities Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5537   Accepted: 3641 Description Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance, 6 = 1…

题目传送门 /* 最大子矩阵和:把二维降到一维,即把列压缩:然后看是否满足最大连续子序列: 好像之前做过,没印象了,看来做过的题目要经常看看:) */ #include <cstdio> #include <iostream> #include <cstring> #include <algorithm> using namespace std; ; const int INF = 0x3f3f3f3f; int a[MAXN][MAXN]; int dp[…

目录 Ural 1250 Sea Burial 题解 题意 输入 题解 程序 Ural 1250 Sea Burial 题解 题意 给定一个\(n\times m\)的地图,\(.\)为水,\(\#\)为陆,地图的外部是水(地图被水包围).水为八连通,陆为四联通.联通的水称为海,联通的陆称为岛.海内可能有岛,岛内可能有海.给定\(x,y\)求在包含\((x,y)\)(保证\((x,y)\)为水)的海里面有多少岛. 输入 第一行包含\(m,n,y,x(1\le n,m\le 500,1\le x…

一.Description Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance, 6 = 1 + 2 + 3 9 = 5 + 4 = 2 + 3 + 4 but 8 cannot be so written. Write a program which will compute how many differ…

[题意]给出n(1~250000)个数(int以内),求中位数 [题解]一开始直接sort,发现MLE,才发现内存限制1024k,那么就不能开int[250000]的数组了(4*250000=1,000,000大约就是1M内存). 后来发现可以使用长度为n/2+1的优先队列,即包含前一半的数以及中位数,其他数在读入的时候就剔除,这样可以省一半的空间. #include<bits/stdc++.h> #define eps 1e-9 #define FOR(i,j,k) for(int i=j;…

Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. Input The first line of the input contains…

文章目录 题意 思路 特殊情况k=0 Source Code 1 Source Code 2 题意 给定一个数组和一个整数k,返回是否存在一个长度至少为2的连续子数组的和为k的倍数. 思路 和上一篇博客的思路基本一致. LeetCode subarray-sum-equals-k题解 所不同的是,子数组至少长度为2.因此需要一个缓冲区,延缓往Hash表中加数的操作. 另外,因为是和变成是k的倍数.利用同余的知识易得我们维护的前缀和是群ZkZ_kZk​中的和. ps.这里我犯了一个错误,没有考虑k…

题意:\(f(x,m)\)表示\(x\ mod\ m\),\(A_{1}=1\),而\(A_{n+1}=f(A^{2}_{n},M)\),求\(\sum^{n}_{i=1}A_{i}\). 题解:多算几个,会有一个循环节,直接模拟就好了. 代码: ll n,x,m; ll mp[N]; vector<ll> a; int main() { //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); scanf("%lld %lld %l…

1146. Maximum Sum Time limit: 0.5 secondMemory limit: 64 MB Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this p…